update

leetcode-cn/originData/integer-break.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个正整数&nbsp;<code>n</code>&nbsp;，将其拆分为 <code>k</code> 个 <strong>正整数</strong> 的和（&nbsp;<code>k &gt;= 2</code>&nbsp;），并使这些整数的乘积最大化。</p>\n\n<p>返回 <em>你可以获得的最大乘积</em>&nbsp;。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入: </strong>n = 2\n<strong>输出: </strong>1\n<strong>解释: </strong>2 = 1 + 1, 1 × 1 = 1。</pre>\n\n<p><strong>示例&nbsp;2:</strong></p>\n\n<pre>\n<strong>输入: </strong>n = 10\n<strong>输出: </strong>36\n<strong>解释: </strong>10 = 3 + 3 + 4, 3 ×&nbsp;3 ×&nbsp;4 = 36。</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>2 &lt;= n &lt;= 58</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 765,
+            "likes": 798,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"149.4K\", \"totalSubmission\": \"242.9K\", \"totalAcceptedRaw\": 149442, \"totalSubmissionRaw\": 242928, \"acRate\": \"61.5%\"}",
+            "stats": "{\"totalAccepted\": \"159.2K\", \"totalSubmission\": \"258.3K\", \"totalAcceptedRaw\": 159163, \"totalSubmissionRaw\": 258289, \"acRate\": \"61.6%\"}",
             "hints": [
                 "There is a simple O(n) solution to this problem.",
                 "You may check the breaking results of <i>n</i> ranging from 7 to 10 to discover the regularities."