update

leetcode-cn/originData/jian-sheng-zi-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一根长度为 <code>n</code> 的绳子，请把绳子剪成整数长度的 <code>m</code> 段（m、n都是整数，n&gt;1并且m&gt;1），每段绳子的长度记为 <code>k[0],k[1]...k[m-1]</code> 。请问 <code>k[0]*k[1]*...*k[m-1]</code> 可能的最大乘积是多少？例如，当绳子的长度是8时，我们把它剪成长度分别为2、3、3的三段，此时得到的最大乘积是18。</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入: </strong>2\n<strong>输出: </strong>1\n<strong>解释: </strong>2 = 1 + 1, 1 &times; 1 = 1</pre>\n\n<p><strong>示例&nbsp;2:</strong></p>\n\n<pre><strong>输入: </strong>10\n<strong>输出: </strong>36\n<strong>解释: </strong>10 = 3 + 3 + 4, 3 &times;&nbsp;3 &times;&nbsp;4 = 36</pre>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>2 &lt;= n &lt;= 58</code></li>\n</ul>\n\n<p>注意：本题与主站 343 题相同：<a href=\"https://leetcode-cn.com/problems/integer-break/\">https://leetcode-cn.com/problems/integer-break/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 398,
+            "likes": 419,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"199.8K\", \"totalSubmission\": \"349.5K\", \"totalAcceptedRaw\": 199831, \"totalSubmissionRaw\": 349505, \"acRate\": \"57.2%\"}",
+            "stats": "{\"totalAccepted\": \"208.9K\", \"totalSubmission\": \"364.8K\", \"totalAcceptedRaw\": 208869, \"totalSubmissionRaw\": 364847, \"acRate\": \"57.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,