DFS
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Permutations II
class Solution { public: vector > ret; vector sln; unordered_map map; void DFS(int n) { if (n == 0) { ret.push_back(sln); return; }原创 2013-01-28 03:10:54 · 359 阅读 · 0 评论 -
[LeetCode] Combination Sum
class Solution { public: vector > ret; vector sln; void DFS(vector &nums, int target, int n) { if (target == 0) { ret.push_back(sln); return; }原创 2013-01-28 04:05:33 · 335 阅读 · 0 评论 -
[LeetCode] Permutations
class Solution { public: vector > ret; vector sln; void DFS(vector &num, vector &used, int n) { if (n == num.size()) { ret.push_back(sln); return;原创 2013-01-27 23:34:35 · 368 阅读 · 0 评论 -
[LeetCode] Combination Sum II
class Solution { public: vector > ret; vector sln; void DFS(vector num, int target, int pos) { if (target == 0) { vector v(sln); reverse(v.begin(), v.e原创 2013-01-28 04:23:07 · 632 阅读 · 0 评论 -
[LeetCode] Generate Parentheses
class Solution { public: vector ret; vector sln; void DFS(int p, int q) { if (p > q) return; if (q == 0) { string s = "";原创 2013-01-28 18:20:25 · 485 阅读 · 0 评论