递归
关注
分享
扫一扫
ChenD17
这个作者很懒，什么都没留下…
展开
-
leetcode-200-岛屿数量
classSolution{public:vector<vector<int>>move={{0,1},{1,0},{0,-1},{-1,0}};//y,x右下左上voidmarkIslands(vector<vector<char>>&grid,inty,intx){...原创 2020-06-22 20:08:14 · 212 阅读 · 0 评论 -
leetcode-79-单词搜索
classSolution{public:vector<vector<int>>move={{0,1},{1,0},{0,-1},{-1,0}};//右下左上vector<vector<bool>>visited;booloutofArea(vector<vector<ch...原创 2020-06-22 20:08:32 · 145 阅读 · 0 评论 -
leetcode-90-子集II
classSolution{public:vector<vector<int>>res;intflag=0;voidhelper(vector<int>nums,intbegin,vector<int>curres){if(flag)res.push_back...原创 2020-06-22 20:08:04 · 146 阅读 · 0 评论 -
leetcode-40-组合总和II
classSolution{public:vector<vector<int>>res={};voidhelper(vector<int>&candidates,inttarget,intbegin,vector<int>curres){if(target==0)...原创 2020-06-22 20:08:51 · 120 阅读 · 0 评论 -
leetcode-39-组合总和
classSolution{public:vector<vector<int>>res={};voidhelper(vector<int>&candidates,inttarget,intbegin,vector<int>curres){if(target==...原创 2020-06-22 20:09:00 · 99 阅读 · 0 评论 -
leetcode-77-组合
classSolution{public:vector<vector<int>>res;voidhelper(intbegin,intn,intk,vector<int>curres){if(curres.size()==k)res.push_back(curres);...原创 2020-06-22 20:09:07 · 143 阅读 · 0 评论 -
leetcode-47-全排列II
classSolution{public:vector<bool>used;vector<vector<int>>res;voidhelper(vector<int>&nums,intindex,vector<int>curres){if(ind...原创 2020-06-22 20:09:35 · 191 阅读 · 0 评论 -
leetcode-46-全排列
classSolution{public:vector<vector<int>>res={};voidhelper(vector<int>nums,vector<int>curres){if(nums.size()==0)res.push_back(curres);...原创 2020-06-22 20:09:16 · 128 阅读 · 0 评论 -
leetcode-131-分割回文串
classSolution{public:vector<vector<string>>res;boolisHuiwen(strings){for(inti=0;i<s.length()/2;i++)if(s[i]!=s[s.length()-1-i])returnfa...原创 2020-06-22 20:10:24 · 252 阅读 · 0 评论 -
leetcode-17-电话号码的字母组合
//回溯法classSolution{vector<string>letter_map={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};//0-9vector<string>res={};voidletterCombine(s...原创 2020-06-22 20:10:34 · 156 阅读 · 0 评论 -
leetcode-437-路径总和III
classSolution{public://包含root结点的条数intfindPath(TreeNode*root,intsum){intres=0;if(root){if(root->val==sum)res++;//if(roo...原创 2020-06-22 20:11:54 · 163 阅读 · 0 评论 -
leetcode-437-路径总和III
classSolution{public://包含root结点的条数intfindPath(TreeNode*root,intsum){intres=0;if(root){if(root->val==sum)res++;//if(roo...原创 2020-06-22 20:12:01 · 111 阅读 · 0 评论 -
leetcode-113-路径总和II
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-22 20:11:32 · 147 阅读 · 0 评论 -
leetcode-257-二叉树的所有路径
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-22 20:09:52 · 144 阅读 · 0 评论 -
leetcode-404-左叶子之和
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-22 20:10:02 · 120 阅读 · 0 评论 -
leetcode-112-路径总和
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-23 14:26:45 · 181 阅读 · 0 评论 -
leetcode-110-平衡二叉树
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-22 20:12:16 · 135 阅读 · 0 评论 -
leetcode-101-对称二叉树
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-22 20:12:09 · 164 阅读 · 0 评论 -
leetcode-100-相同的树
/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NULL){}*};...原创 2020-06-22 20:10:44 · 96 阅读 · 0 评论 -
leetcode-226-翻转二叉树
//注意使用swap/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(NUL...原创 2020-06-22 20:11:26 · 128 阅读 · 0 评论 -
leetcode-111-二叉树的最小深度
//和最大深度的情况不一样，注意不能直接return min(左右子叶递归)/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):v...原创 2020-06-22 20:10:54 · 160 阅读 · 0 评论 -
leetcode-104-二叉树的最大深度
//递归，不用helper/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode(intx):val(x),left(NULL),right(...原创 2020-06-23 14:26:54 · 134 阅读 · 0 评论 -
leetcode-714-买卖股票的最佳时间
//未AC，19/44，超时#include<stdio.h>#include<math.h>#include<vector>#include<string>#include<iostream>#include<algorithm>using namespace std;class Solution ...原创 2020-06-28 09:47:04 · 198 阅读 · 0 评论 -
leetcode-258-各位相加
using namespace std;//日常取余操作class Solution {public: int addDigits(int num) { if (num / 10 == 0) return num; int sum = 0; while (num / 10 != 0) { sum += num...原创 2020-06-23 14:29:42 · 163 阅读 · 0 评论