u011089927的专栏

class Solution {public: vector<vector<string>> res; vector<vector<string>> partition(string s) { if(s.length()<=0) return res; vector<string> path; back(s,path,0);//从第0个位置开始，一路遍历到最后一个字符 return res;.

class Solution {public: vector<TreeNode*> generateTrees(int n) { vector<TreeNode*> res; if(n<=0) return res; res = build(1,n); return res; } vector<TreeNode*> build(int begin,int end){ .

class Solution {public: bool isScramble(string s1, string s2) { if(s1.length()==0||s2.length()==0){ if(s1.length()==0&&s2.length()==0) return true; else return false; } return is(s1,s2); } .

class Solution {public: unordered_map<string,vector<string>> map; vector<string> wordBreak(string s, vector<string>& wordDict) { vector<string> all; if(wordDict.empty()) return all; unorde.

class Solution {public: vector<vector<int>> all; vector<vector<int>> subsets(vector<int>& nums) { all.push_back(vector<int>()); if(nums.empty()) return all; for(int i=1;i<=nums.si.

class Solution {public: vector<vector<int>> all; vector<vector<int>> combine(int n, int k) { if(n==0||k==0) return all; vector<int> num; for(int i=1;i<=n;i++) num.push_back(i); vector&.

写了一个挫的，超时了。class Solution {public: string res=""; string getPermutation(int n, int k) { if(n<=0||k<=0) return res; vector<char> num; for(int i=1;i<=n;i++) { num.push_back('0'+i);

class Solution {public: vector<vector<int>> all; vector<vector<int>> combinationSum2(vector<int>& candidates, int target) { if(candidates.empty()) return all; vector<int> one; sort(.

class Solution {public: vector<vector<int>> all; vector<vector<int>> combinationSum(vector<int>& candidates, int target) { if(candidates.empty()) return all; vector<int> one; sort(candidates.beg.

class Solution {public: void nextPermutation(vector<int>& nums) { if(nums.empty()) return; for(int i=nums.size()-1;i>=0;i--) { int idx = back(nums,i+1,nums[i]); if(idx>i && idx&l.

开启分类模式class Solution {public: unordered_map<string,vector<string>> save; vector<string> letterCombinations(string digits) { vector<string> res; if(digits.length()<=0) return res; save["2"]=vect