largest-palindrome-product

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer n, return the largest palindromic integer that can be represented as the product of two <code>n</code>-digits integers. Since the answer can be very large, return it modulo <code>1337</code>.

&nbsp;
Example 1:

<pre>
Input: n = 2
Output: 987
Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
</pre>

Example 2:

<pre>
Input: n = 1
Output: 9
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>

largestPalindrome

Largest Palindrome Product

Math

Enumeration

给定一个整数 n ，返回 可表示为两个 <code>n</code>&nbsp;位整数乘积的 最大回文整数 。因为答案可能非常大，所以返回它对 <code>1337</code> 取余 。

&nbsp;

示例 1：

<pre>
输入：n = 2
输出：987
解释：99 x 91 = 9009, 9009 % 1337 = 987
</pre>

示例 2：

<pre>
输入：n = 1
输出：9
</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>