【leetcode】Subsets 1&2
来源:互联网 发布:mfc windows 程序设计 编辑:程序博客网 时间:2024/06/13 23:12
Subsets
Given a set of distinct integers, nums, return all possible subsets.
Note:
• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,3], a solution is:
[ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]
思路:
深度搜索,元素存在或者不存在两种可能,然后进行深搜。
class Solution {public: vector<vector<int> > res; vector<int> temp; void sub(vector<int>& nums, int index) { if(index==nums.size()) { res.push_back(temp); return; } sub(nums,index+1); temp.push_back(nums[index]); sub(nums,index+1); temp.pop_back(); } vector<vector<int> > subsets(vector<int>& nums) { sort(nums.begin(),nums.end()); sub(nums,0); return res; }};
Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets.
Note:
• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.
For example,
If nums = [1,2,2], a solution is:
[ [2], [1], [1,2,2], [2,2], [1,2], [] ]
思路:
(1) 用STL的库函数,对vector的数去重unique(res.begin(),res.end());
(2) 在subset问题的基础上,修改,在push_back的基础上,判断是否一致。
class Solution {public: vector<vector<int> > res; vector<int> temp; void sub(vector<int>& nums, int index) { if(index==nums.size()) { for(int i=0;i<res.size();i++) { if(temp==res[i]) return; } res.push_back(temp); return; } sub(nums,index+1); temp.push_back(nums[index]); sub(nums,index+1); temp.pop_back(); } vector<vector<int> > subsetsWithDup(vector<int>& nums) { sort(nums.begin(),nums.end()); sub(nums,0); //unique(res.begin(),res.end()); return res; }};
- 【leetcode】Subsets 1&2
- leetcode 78|90. Subsets 1|2
- 【LeetCode】 Subsets Subsets II
- 【LeetCode】Subsets & Subsets II
- LeetCode Subsets && Subsets II
- LeetCode Subsets && Subsets II
- LeetCode-Subsets & Subsets II
- LeetCode: Subsets
- LeetCode Subsets
- [Leetcode] Subsets
- LeetCode : Subsets
- [LeetCode] Subsets
- Leetcode: Subsets
- Leetcode: Subsets ||
- [leetcode] subsets
- Leetcode - Subsets
- [LeetCode]Subsets
- LeetCode-Subsets
- 4.1-2
- iOS提交后申请加急审核
- 6.2 视图UIView及视图控制器(UIViewController)
- #101 Symmetric Tree
- HDU ACM 5253 连接的管道->最小生成树(并查集)
- 【leetcode】Subsets 1&2
- Unix环境高级编程 章一:进程控制
- 菜鸟学Android笔记(十六):零散的知识点
- OPENCART之兼容多种浏览器的加入收藏夹扩展功能插件(CROSS-BROWSER BOOKMARK)
- 华为OJ(三)
- python中的内建函数(BIF)
- 数据结构与算法分析学习笔记(2)--拓扑排序
- Namespace:Openstack的网络实现
- package.loaded