update

leetcode-cn/originData/burst-balloons.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>有 <code>n</code> 个气球，编号为<code>0</code> 到 <code>n - 1</code>，每个气球上都标有一个数字，这些数字存在数组 <code>nums</code> 中。</p>\n\n<p>现在要求你戳破所有的气球。戳破第 <code>i</code> 个气球，你可以获得 <code>nums[i - 1] * nums[i] * nums[i + 1]</code> 枚硬币。 这里的 <code>i - 1</code> 和 <code>i + 1</code> 代表和 <code>i</code> 相邻的两个气球的序号。如果 <code>i - 1</code>或 <code>i + 1</code> 超出了数组的边界，那么就当它是一个数字为 <code>1</code> 的气球。</p>\n\n<p>求所能获得硬币的最大数量。</p>\n\n<p> </p>\n<strong>示例 1：</strong>\n\n<pre>\n<strong>输入：</strong>nums = [3,1,5,8]\n<strong>输出：</strong>167\n<strong>解释：</strong>\nnums = [3,1,5,8] --> [3,5,8] --> [3,8] --> [8] --> []\ncoins =  3*1*5    +   3*5*8   +  1*3*8  + 1*8*1 = 167</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,5]\n<strong>输出：</strong>10\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>n == nums.length</code></li>\n\t<li><code>1 <= n <= 500</code></li>\n\t<li><code>0 <= nums[i] <= 100</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 940,
+            "likes": 945,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Cost to Merge Stones\", \"titleSlug\": \"minimum-cost-to-merge-stones\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u5408\\u5e76\\u77f3\\u5934\\u7684\\u6700\\u4f4e\\u6210\\u672c\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"68.9K\", \"totalSubmission\": \"99.9K\", \"totalAcceptedRaw\": 68905, \"totalSubmissionRaw\": 99923, \"acRate\": \"69.0%\"}",
+            "stats": "{\"totalAccepted\": \"69.2K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 69190, \"totalSubmissionRaw\": 100287, \"acRate\": \"69.0%\"}",
             "hints": [],
             "solution": null,
             "status": null,