题目要求如下:
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], [] ]本题我用的dynamically programming的方法,
基本思路:
首先先把[]得出,此时返回的vector的size为1,
然后设定一个临时vector,使其等于[],在后面插入1,再插入到返回vector中,此时有[]和[1]
下一步,取出[],[1]后面都插入2,则此时返回的vector中,有[][1][2][1,2]
再把上面得出的vector斗取出,插入3,得到[][1][2][1,2][3][1,3][2,3][1,2,3]得到正确解
代码如下:
class Solution {
public:
vector<vector<int> > subsets(vector<int> &S) {
vector<vector<int>> retVal;
sort(S.begin(), S.end());
retVal.push_back(vector<int>()); /* the empty vector */
for (int i = 0; i < S.size(); ++i) {
int retVal_size = retVal.size();
for (int j = 0; j < retVal_size; ++j) {
vector<int> tmp = retVal[j];
tmp.push_back(S[i]);
retVal.push_back(tmp);
}
}
return retVal;
}
};