class Solution {
public:
vector<vector<int>> subsets(vector<int>& nums) {
vector<vector<int>> ret;
int i,end;
vector<int> num;
ret.push_back(num);
for(auto it: nums)
{
for(i=0,end=ret.size();i<end;++i)
{
num=ret[i];
num.push_back(it);
ret.push_back(num);
}
}
return ret;
}
};
leetcode - 78. Subsets
最新推荐文章于 2024-03-27 08:30:00 发布