coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 03:11:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
leetcode-cn/problem (Chinese)/最大回文数乘积 [largest-palindrome-product].html
View File

@@ -2,19 +2,19 @@
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<p><strong class="example">示例 1：</strong></p>
<pre>
<b>输入：</b>n = 2
<b>输出：</b>987
<strong>输入：</strong>n = 2
<strong>输出：</strong>987
<strong>解释：</strong>99 x 91 = 9009, 9009 % 1337 = 987
</pre>
<p><strong>示例 2:</strong></p>
<p><strong class="example">示例 2：</strong></p>
<pre>
<strong>输入：</strong> n = 1
<strong>输出：</strong> 9
<strong>输入：</strong>n = 1
<strong>输出：</strong>9
</pre>
<p>&nbsp;</p>