1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 13:36:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给你一个整数数组 <code>nums</code> ,其中可能包含重复元素,请你返回该数组所有可能的子集(幂集)。</p>\n\n<p>解集 <strong>不能</strong> 包含重复的子集。返回的解集中,子集可以按 <strong>任意顺序</strong> 排列。</p>\n\n<div class=\"original__bRMd\">\n<div>\n<p> </p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [1,2,2]\n<strong>输出:</strong>[[],[1],[1,2],[1,2,2],[2],[2,2]]\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [0]\n<strong>输出:</strong>[[],[0]]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10</code></li>\n\t<li><code>-10 <= nums[i] <= 10</code></li>\n</ul>\n</div>\n</div>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 780,
"likes": 810,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Subsets\", \"titleSlug\": \"subsets\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5b50\\u96c6\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"182.1K\", \"totalSubmission\": \"287.1K\", \"totalAcceptedRaw\": 182134, \"totalSubmissionRaw\": 287146, \"acRate\": \"63.4%\"}",
"stats": "{\"totalAccepted\": \"193.6K\", \"totalSubmission\": \"305.1K\", \"totalAcceptedRaw\": 193636, \"totalSubmissionRaw\": 305141, \"acRate\": \"63.5%\"}",
"hints": [],
"solution": null,
"status": null,