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], [] ]
基本思路:
1, 先插入一个空集作为起始。
2, 然后对结果集中的每个元素,复制并添加上新增字符。
此代码,在leetcode上实际执行时间为16ms。
class Solution {
public:
vector<vector<int> > subsets(vector<int> &S) {
sort(S.begin(), S.end());
vector<vector<int> > ans(1);
for (int i=0; i<S.size(); i++) {
const int size = ans.size();
for (int j=0; j<size; j++) {
ans.push_back(ans[j]);
ans.back().push_back(S[i]);
}
}
return ans;
}
};