https://leetcode.com/problems/subsets/
solution의 Cascading 방식으로 쉽게 문제를 풀 수 있었다.
class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> answer;
vector<int> empty;
answer.push_back(empty);
for(int i=0; i<nums.size(); i++) {
vector<vector<int>> temp;
for(int j=0; j<answer.size(); j++) {
temp.push_back(answer[j]);
}
for(int j=0; j<temp.size(); j++) {
temp[j].push_back(nums[i]);
}
for(int j=0; j<temp.size(); j++) {
answer.push_back(temp[j]);
}
}
return answer;
}
};