[LeetCode] 90. Subsets II
来源:互联网 发布:saas企业级软件服务 编辑:程序博客网 时间:2024/06/04 18:24
思路:
和之前很多的DFS问题一样, 与之前的subset I思路也相同, 就是加一个判断, 排除当前的数字和前一个是不是相同的情况即可.
void dfs(vector<vector<int>>& res, vector<int>& nums, vector<int>& set, int start) { res.push_back(set); for (int i = start; i < nums.size(); i++) { if (i > start && nums[i] == nums[i - 1]) continue; set.push_back(nums[i]); dfs(res, nums, set, i + 1); set.pop_back(); }}vector<vector<int>> subsetsWithDup(vector<int>& nums) { vector<vector<int>> res; vector<int> set; sort(nums.begin(), nums.end()); dfs(res, nums, set, 0); return res;}
0 0
- [LeetCode]90.Subsets II
- [Leetcode] 90. Subsets II
- LeetCode --- 90. Subsets II
- [leetcode] 90.Subsets II
- 【leetcode】90. Subsets II
- Leetcode 90. Subsets II
- 90. Subsets II LeetCode
- leetcode 90. Subsets II
- Leetcode 90. Subsets II
- LeetCode *** 90. Subsets II
- LeetCode 90. Subsets II
- leetcode 90. Subsets II
- leetcode 90. Subsets II
- [LeetCode] 90. Subsets II
- [leetcode] 90. Subsets II
- [leetcode]90. Subsets II
- Leetcode-90. Subsets II
- [LeetCode]90. Subsets II
- java中toCharArray()方法的使用
- LeetCode:206. Reverse Linked List
- hibernate3与spring2.5.6整合Demo
- LeetCode:328. Odd Even Linked List
- hibernate初识
- [LeetCode] 90. Subsets II
- Activity 的 生命周期分析
- 数学基础 —— 向量运算(点积)
- Java.Web学习笔记 Struts1
- LeetCode:237. Delete Node in a Linked List
- HDU1024 这压缩真先进...先进的我想跳河
- 岛上书店荐书录
- hdu 5802 windows 10
- 嵌入式web服务器lighttpd的交叉编译及配置--xilinx zynq