本文主要是介绍LeetCode90. Subsets II，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
文章目录
- 一、题目
- 二、题解
一、题目
Given an integer array nums that may contain duplicates, return all possible
subsets
(the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
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
二、题解
class Solution {
public:vector<vector<int>> res;vector<int> path;void backtracking(vector<int>& nums,int startIndex){res.push_back(path);for(int i = startIndex;i < nums.size();i++){if(i > startIndex && nums[i] == nums[i-1]) continue;path.push_back(nums[i]);backtracking(nums,i + 1);path.pop_back();}}vector<vector<int>> subsetsWithDup(vector<int>& nums) {sort(nums.begin(),nums.end());backtracking(nums,0);return res;}
};
这篇关于LeetCode90. Subsets II的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
