首页 > 其他 > 详细

[LeetCode] Largest Palindrome Product 最大回文串乘积

时间:2017-10-10 12:42:22      阅读:234      评论:0      收藏:0      [点我收藏+]

 

Find the largest palindrome made from the product of two n-digit numbers.

Since the result could be very large, you should return the largest palindrome mod 1337.

Example:

Input: 2

Output: 987

Explanation: 99 x 91 = 9009, 9009 % 1337 = 987

 

Note:

The range of n is [1,8].

 

s

 

 

 

 

[LeetCode] Largest Palindrome Product 最大回文串乘积

原文:http://www.cnblogs.com/grandyang/p/7644725.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!