Leetcode NO.78 Subsets
来源:互联网 发布:显示二维码的数据 编辑:程序博客网 时间:2024/06/03 02:14
题目要求如下:
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; }};
0 0
- Leetcode NO.78 Subsets
- Leetcode No.78 Subsets
- LeetCode No.78 Subsets
- LeetCode--No.78--Subsets
- Leetcode NO.90 Subsets II
- LeetCode No.90 Subsets II
- [LeetCode 78] Subsets && [LeetCode 90] Subsets II
- LeetCode 78: Subsets
- LeetCode 78 Subsets
- [leetcode 78] Subsets
- [LeetCode 78]Subsets
- leetcode-78 Subsets
- leetcode || 78、Subsets
- Subsets - LeetCode 78
- leetcode 78 :Subsets
- LeetCode(78) Subsets
- Leetcode #78 Subsets
- leetcode 78: Subsets
- 而如今的她,坚强而隐忍
- Artificial Neural Network Notes
- Lua中的基本函数库
- CSDN对我的记忆
- qsort 常用方法总结
- Leetcode NO.78 Subsets
- lua实现面向对象
- java vm 参数及设置(转载)
- 【难】【分治法】【树】求树中长度最大的路径
- python连接mysql之mysql-python安装
- HttpClient+AsyncTask开发App
- C的格式化输入输出
- mysql主从切换
- 脉动的直流电