update

leetcode-cn/originData/partition-equal-subset-sum.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个 <strong>只包含正整数 </strong>的 <strong>非空 </strong>数组 <code>nums</code> 。请你判断是否可以将这个数组分割成两个子集，使得两个子集的元素和相等。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,5,11,5]\n<strong>输出：</strong>true\n<strong>解释：</strong>数组可以分割成 [1, 5, 5] 和 [11] 。</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,2,3,5]\n<strong>输出：</strong>false\n<strong>解释：</strong>数组不能分割成两个元素和相等的子集。\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 200</code></li>\n\t<li><code>1 <= nums[i] <= 100</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 1223,
+            "likes": 1272,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Partition to K Equal Sum Subsets\", \"titleSlug\": \"partition-to-k-equal-sum-subsets\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5212\\u5206\\u4e3ak\\u4e2a\\u76f8\\u7b49\\u7684\\u5b50\\u96c6\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"235.7K\", \"totalSubmission\": \"458.4K\", \"totalAcceptedRaw\": 235700, \"totalSubmissionRaw\": 458389, \"acRate\": \"51.4%\"}",
+            "stats": "{\"totalAccepted\": \"252.5K\", \"totalSubmission\": \"490K\", \"totalAcceptedRaw\": 252468, \"totalSubmissionRaw\": 489952, \"acRate\": \"51.5%\"}",
             "hints": [],
             "solution": null,
             "status": null,