[LeetCode] Largest Palindrome Product 最大回文串乘积
Posted Grandyang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Largest Palindrome Product 最大回文串乘积相关的知识,希望对你有一定的参考价值。
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 最大回文串乘积的主要内容,如果未能解决你的问题,请参考以下文章
#Leetcode# 179. Largest Number
LeetCode Largest Divisible Subset