Commit9e29029

committed

[Function add]

1. Add c++ version of leetcode solutions.

1 parentf0b78e6 commit9e29029Copy full SHA for 9e29029

File tree

+105

-0

lines changed

+105

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -123,3 +123,35 @@ class Solution {`
`123`	`123`	`}`
`124`	`124`	`}`
`125`	`125`	```
	`126`	`+`
	`127`	`+###C++ version`
	`128`	`+* Method 1: Recursion`
	`129`	+```objectivec
	`130`	`+class Solution {`
	`131`	`+int target_;`
	`132`	`+`
	`133`	`+void recursion(vector<int>& candidates, int index, int sum, vector<int>& cur, vector<vector<int>>& res_){`
	`134`	`+if(target_ == sum) res_.push_back(cur);`
	`135`	`+else if(sum < target_){`
	`136`	`+int size = candidates.size();`
	`137`	`+for(int i = index; i < size; ++i){`
	`138`	`+while(i > index && i < size && candidates[i] == candidates[i - 1]) ++i;`
	`139`	`+if(i >= size) break;`
	`140`	`+cur.emplace_back(candidates[i]);`
	`141`	`+recursion(candidates, i + 1, sum + candidates[i], cur, res_);`
	`142`	`+cur.pop_back();`
	`143`	`+}`
	`144`	`+}`
	`145`	`+}`
	`146`	`+public:`
	`147`	`+vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {`
	`148`	`+if(candidates.empty()) return {};`
	`149`	`+sort(candidates.begin(), candidates.end());`
	`150`	`+vector<vector<int>> res_;`
	`151`	`+vector<int> cur;`
	`152`	`+target_ = target;`
	`153`	`+recursion(candidates, 0, 0, cur, res_);`
	`154`	`+return res_;`
	`155`	`+}`
	`156`	`+};`
	`157`	+```

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -89,3 +89,28 @@ class Solution {`
`89`	`89`	`}`
`90`	`90`	`}`
`91`	`91`	```
	`92`	`+`
	`93`	`+###C++ Version`
	`94`	`+* Method 1: Recursion`
	`95`	+```objectivec
	`96`	`+class Solution {`
	`97`	`+void recursion(int n, int cur, int k, vector<int>& temp, vector<vector<int>>& res){`
	`98`	`+if(k == temp.size()) res.emplace_back(temp);`
	`99`	`+else{`
	`100`	`+for(int i = cur; i <= n; ++i){`
	`101`	`+temp.emplace_back(i);`
	`102`	`+recursion(n, i + 1, k, temp, res);`
	`103`	`+temp.pop_back();`
	`104`	`+}`
	`105`	`+}`
	`106`	`+}`
	`107`	`+public:`
	`108`	`+vector<vector<int>> combine(int n, int k) {`
	`109`	`+if(k == 0 \|\| n < k) return {};`
	`110`	`+vector<vector<int>> res;`
	`111`	`+vector<int> cur;`
	`112`	`+recursion(n, 1, k, cur, res);`
	`113`	`+return res;`
	`114`	`+}`
	`115`	`+};`
	`116`	+```

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -102,3 +102,26 @@ class Solution {`
`102`	`102`	`}`
`103`	`103`	`}`
`104`	`104`	```
	`105`	`+`
	`106`	`+###C++ version`
	`107`	`+* Method 1: power set`
	`108`	+```objectivec
	`109`	`+class Solution {`
	`110`	`+vector<vector<int>> res;`
	`111`	`+void dfs(int cur, vector<int>& nums, vector<int>& temp){`
	`112`	`+res.emplace_back(temp);`
	`113`	`+for(int i = cur; i < nums.size(); ++i){`
	`114`	`+temp.emplace_back(nums[i]);`
	`115`	`+dfs(i + 1, nums, temp);`
	`116`	`+temp.pop_back();`
	`117`	`+}`
	`118`	`+}`
	`119`	`+public:`
	`120`	`+vector<vector<int>> subsets(vector<int>& nums) {`
	`121`	`+if(nums.empty()) return {};`
	`122`	`+vector<int> temp;`
	`123`	`+dfs(0, nums, temp);`
	`124`	`+return res;`
	`125`	`+}`
	`126`	`+};`
	`127`	+```

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -125,4 +125,29 @@ class Solution {`
`125`	`125`	`}`
`126`	`126`	`}`
`127`	`127`	`}`
	`128`	+```
	`129`	`+`
	`130`	`+###C++ version`
	`131`	+```objectivec
	`132`	`+class Solution {`
	`133`	`+vector<vector<int>> res_;`
	`134`	`+void dfs(int cur, vector<int>& temp, vector<int>& nums){`
	`135`	`+ res_.emplace_back(temp);`
	`136`	`+ int size = nums.size();`
	`137`	`+ for(int i = cur; i < size; ++i){`
	`138`	`+ while(i > cur && i < size && nums[i] == nums[i - 1]) ++i;`
	`139`	`+ if(i >= size) break;`
	`140`	`+ temp.emplace_back(nums[i]);`
	`141`	`+dfs(i + 1, temp, nums);`
	`142`	`+ temp.pop_back();`
	`143`	`+ }`
	`144`	`+ }`
	`145`	`+public:`
	`146`	`+ vector<vector<int>> subsetsWithDup(vector<int>& nums) {`
	`147`	`+ sort(nums.begin(), nums.end());`
	`148`	`+ vector<int> temp;`
	`149`	`+ dfs(0, temp, nums);`
	`150`	`+ return res_;`
	`151`	`+ }`
	`152`	`+};`
`128`	`153`	```

Comments

(0)