← 返回 sofi 的题目列表Array and DFS with Backtracking
类型：online_judge
Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example 1:
Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
Example 2:
Input: nums = [0]
Output: [[],[0]]
Constraints:
1 <= nums.length <= 10
-10 <= nums[i] <= 10
Example
Input
[1,2,2]
Output
[[],[1],[1,2],[1,2,2],[2],[2,2]]