回溯
hebastast
这个作者很懒,什么都没留下…
展开
-
22. Generate Parentheses
class Solution {private: void backtrack(vector<string> &result,string cur,int left,int right,int max) { if(cur.length()==2*max) { result.push_back(cur);原创 2016-08-30 14:33:30 · 307 阅读 · 0 评论 -
hasPath
class Solution {private: vector<vector<int>> directions={{-1,0},{1,0},{0,1},{0,-1}}; bool haspathhelper(char *matrix,int rows,int cols,int currow,int curcol,char *str,int length,int curindex,b原创 2017-03-16 16:42:10 · 649 阅读 · 0 评论 -
306. Additive Number
class Solution {private: bool istrue=false; void judge(vector<long> l,int start,string &num) { if(start>=num.size()) { if(l.size()>=3) {原创 2016-11-19 17:31:20 · 424 阅读 · 0 评论 -
282. Expression Add Operators
class Solution {private: void addhelper(vector<string> &result,string path,string &num,long target,int pos,long eval,long last) { if(pos==num.length()) { if(eval原创 2016-11-13 16:49:18 · 301 阅读 · 0 评论 -
216. Combination Sum III
class Solution {private: void search(vector<vector<int>> &ret,vector<int> &cur,int start,int k,int target) { if(cur.size()>=k) return; for(int i=start;i<=9;i++)原创 2016-10-20 09:34:28 · 284 阅读 · 0 评论 -
257. Binary Tree Paths
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class原创 2016-10-24 10:55:51 · 257 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number
class Solution {private: void solve(vector<string> &result,string &cur,int level,vector<vector<char>> table,string &digits) { if(level==digits.length()) { result.pu原创 2016-09-03 14:53:37 · 322 阅读 · 0 评论 -
52. N-Queens II
class Solution {private: int total=0; void solve(vector<string> &cur,int row,int n) { if(row==n) { total++; return; } else {原创 2016-09-02 16:42:57 · 293 阅读 · 0 评论 -
51. N-Queens
class Solution {private: void solve(vector<vector<string>> &result, vector<string> &cur,int row,int n) { if(row==n) { result.push_back(cur); } else原创 2016-09-02 13:26:34 · 407 阅读 · 0 评论 -
37. Sudoku Solver
class Solution {private: bool sove(vector<vector<char>>&board) { for(int i=0;i<board.size();i++) { for(int j=0;j<board[0].size();j++) {原创 2016-09-01 14:47:32 · 342 阅读 · 0 评论 -
40. Combination Sum II
class Solution {private: void combination(vector<vector<int>>&result,vector<int> &cur,vector<int> &candidate,int target,int begin) { if(!target) { result.push_back(原创 2016-08-31 21:21:39 · 343 阅读 · 0 评论 -
39. Combination Sum
class Solution {private: void combanation(vector<vector<int>> &result,vector<int> &cur,vector<int> &candidate,int target,int begin) { if(!target) { result.push_back原创 2016-08-31 20:30:15 · 295 阅读 · 0 评论 -
movingCount
class Solution {private: int count=0; vector<vector<int>> directions{{-1,0},{1,0},{0,1},{0,-1}}; bool judge(int threshold,int row,int col) { int judgecount=0; while(row原创 2017-03-16 17:51:55 · 439 阅读 · 0 评论