问题描述:
https://leetcode.com/problems/subsets/ 点击打开链接
Given a set of distinct integers, S, 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 S = [1,2,3], a solution is:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]
问题分析:
一直以来都不明白,像递归搜索的这类题目的解法,如何从理论上证明其正确性??
这是搜索一维数组的问题,每个元素a[i]只有两种选择:1. 加入当前搜索集合, 2. 不加入当前搜索集合。搜索结束的条件是: 数组搜索完毕。
示例代码:
class Solution {
public:
/*
* 使用深度优先搜索进行遍历,遍历的结果会得到一颗二叉树
*/
vector<vector<int> > subsets(vector<int> &S)
{
vector<vector<int> > result;
vector<int> tmp;
int n = S.size();
sort(S.begin(), S.end());
subset_dfs(S, 0, n, tmp, result);
return result;
}
void subset_dfs(vector<int> &s, int begin, int n, vector<int> &tmp, vector<vector<int> > &result)
{
if (begin == n)
{
result.push_back(tmp);
return;
}
tmp.push_back(s[begin]);
subset_dfs(s, begin + 1, n, tmp, result);
tmp.pop_back();
subset_dfs(s, begin + 1, n, tmp, result);
}
};