update

leetcode-cn/originData/power-set-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>幂集。编写一种方法，返回某集合的所有子集。集合中<strong>不包含重复的元素</strong>。</p>\n\n<p>说明：解集不能包含重复的子集。</p>\n\n<p><strong>示例:</strong></p>\n\n<pre><strong> 输入</strong>： nums = [1,2,3]\n<strong> 输出</strong>：\n[\n  [3],\n&nbsp; [1],\n&nbsp; [2],\n&nbsp; [1,2,3],\n&nbsp; [1,3],\n&nbsp; [2,3],\n&nbsp; [1,2],\n&nbsp; []\n]\n</pre>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 89,
+            "likes": 91,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 24539, \"totalSubmissionRaw\": 29895, \"acRate\": \"82.1%\"}",
+            "stats": "{\"totalAccepted\": \"25.1K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 25126, \"totalSubmissionRaw\": 30604, \"acRate\": \"82.1%\"}",
             "hints": [
                 "如何从子集{a, b}中构建{a, b, c}的所有子集？",
                 "任何属于{a, b}的子集都是{a, b, c}的子集。哪个集合是{a, b, c}的子集却不是{a, b}的子集。",