1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-01-27 02:30:28 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
leetcode-problemset/leetcode-cn/problem (Chinese)/最大回文数乘积 [largest-palindrome-product].html

27 lines
671 B
HTML
Raw Normal View History

2022-03-27 20:52:13 +08:00
<p>给定一个整数 n ,返回 <em>可表示为两个 <code>n</code>&nbsp;位整数乘积的 <strong>最大回文整数</strong></em> 。因为答案可能非常大,所以返回它对 <code>1337</code> <strong>取余</strong></p>
<p>&nbsp;</p>
2025-01-09 20:29:41 +08:00
<p><strong class="example">示例 1</strong></p>
2022-03-27 20:52:13 +08:00
<pre>
2025-01-09 20:29:41 +08:00
<strong>输入:</strong>n = 2
<strong>输出:</strong>987
2022-03-27 20:52:13 +08:00
<strong>解释:</strong>99 x 91 = 9009, 9009 % 1337 = 987
</pre>
2025-01-09 20:29:41 +08:00
<p><strong class="example">示例 2</strong></p>
2022-03-27 20:52:13 +08:00
<pre>
2025-01-09 20:29:41 +08:00
<strong>输入:</strong>n = 1
<strong>输出:</strong>9
2022-03-27 20:52:13 +08:00
</pre>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>