update

leetcode-cn/originData/largest-palindrome-product.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个整数 n ，返回 <em>可表示为两个 <code>n</code>&nbsp;位整数乘积的 <strong>最大回文整数</strong></em> 。因为答案可能非常大，所以返回它对 <code>1337</code> <strong>取余</strong> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<b>输入：</b>n = 2\n<b>输出：</b>987\n<strong>解释：</strong>99 x 91 = 9009, 9009 % 1337 = 987\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入：</strong> n = 1\n<strong>输出：</strong> 9\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 8</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 50,
+            "likes": 121,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"8.4K\", \"totalAcceptedRaw\": 3672, \"totalSubmissionRaw\": 8377, \"acRate\": \"43.8%\"}",
+            "stats": "{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"33.8K\", \"totalAcceptedRaw\": 21180, \"totalSubmissionRaw\": 33789, \"acRate\": \"62.7%\"}",
             "hints": [],
             "solution": null,
             "status": null,