78. Subsets LeetCode
2016-02-16 19:12
375 查看
题意：给出一个集合，求这个集合的所有子集。要求集合内升序排序。
题解：递归求解。
题解：递归求解。
class Solution {
public:
void dfs(vector<vector<int>>& ans,vector<int> pre,vector<int>& nums ,int k)
{
for(int i = k; i < nums.size(); i++)
{
pre.push_back(nums[i]);
ans.push_back(pre);
dfs(ans,pre,nums,i + 1);
pre.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
sort(nums.begin(),nums.end());
vector<int> pre;
vector<vector<int>> ans;
pre.clear();
ans.clear();
ans.push_back(pre);
dfs(ans,pre,nums,0);
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解