- 博客(22)
- 收藏
- 关注
RSS订阅原创 leetcode 701. 二叉搜索树中的插入操作
9月份的最后一天吖，明天就是国庆啦，总所周知7+3=1orz，国庆也要认真学习吖/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val
2020-09-30 19:41:24
39
原创 leetcode 145. 二叉树的后序遍历
啊啊啊啊啊啊啊啊啊啊啊，终于来了一个我看起来比较简单的题目了！！！/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), le
2020-09-29 19:10:12
37
原创 leetcode 117. 填充每个节点的下一个右侧节点指针 II
/*// Definition for a Node.class Node {public: int val; Node* left; Node* right; Node* next; Node() : val(0), left(NULL), right(NULL), next(NULL) {} Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {} Node(i
2020-09-28 19:35:14
130
原创 leetcode 235. 二叉搜索树的最近公共祖先
利用二叉搜索树的特性左子树的值都比根节点小，右子树的值都比根节点大这一特点来做就好了/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution
2020-09-27 15:24:27
434
原创 leetcode 113. 路径总和 II
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:vector<vector<int>>res;
2020-09-26 19:53:16
40
原创 leetcode 171. Excel表列序号
class Solution {public:int titleToNumber(string s) { int res = 0; if (s.length() == 0) { return 0; } for (int i = 0; i < s.length(); i++) { int num = s[i] - 'A' + 1; res = res * 26+num; } return res;}};
2020-09-25 17:37:15
45
原创 leetcode 501. 二叉搜索树中的众数
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:unordered_map<int, int>mp;ve
2020-09-24 19:27:41
57
原创 leetcode 617. 合并二叉树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:TreeNode* mergeTrees(TreeNode* t1,
2020-09-23 19:18:01
56
原创 167. 两数之和 II - 输入有序数组
看到题目第一眼想到了dfs，一部分原因也是因为前几天的题目都是DFS，而且两数之和也很符合DFS，但是我写了一下发现并不考研，之后又开始了暴力法，然后不出意外的超时了之后就是现在的AC代码了，以后组题目还是要看清楚题目在开始啊！！！class Solution {public:vector<int> twoSum(vector<int>& numbers, int target){ vector<int>res; int l = 0, r = num
2020-09-22 19:14:19
131
原创 leetcode 78. 子集
class Solution {private: vector<vector<int>> res; vector<int> ans; void dfs(vector<int>& nums, int index) { res.push_back(ans); for (int i = index; i < nums.size(); i++) { ans.push_bac
2020-09-21 16:47:32
44
原创 leetcode 538. 把二叉搜索树转换为累加树
害，学到现在还不知道累加树是啥，真就学了个寂寞呗/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int su
2020-09-21 16:32:28
35
原创 leetcode 78. 子集
class Solution {private: vector<vector<int>> res; vector<int> ans; void dfs(vector<int>& nums, int index) { res.push_back(ans); for (int i = index; i < nums.size(); i++) { ans.push_bac
2020-09-20 14:05:01
37
原创 leetcode 47. 全排列 II
class Solution {public:vector<vector<int>>res;vector<vector<int>> permuteUnique(vector<int>& nums){ sort(nums.begin(),nums.end()); do { res.push_back(nums); } while(next_permutation(nums.begin(
2020-09-18 17:36:21
59
原创 leetcode 155. 最小栈
class MinStack { vector<int>Q;public: MinStack() { } void push(int x) { Q.push_back(x); } void pop() { Q.pop_back(); } int top() { return Q.back(); } int getMin() { int mmin = INT_MAX; for (int i = 0; i < Q.size(); i++)
2020-09-17 19:54:01
62
原创 leetcode 226. 翻转二叉树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* invertTree(TreeNode*
2020-09-16 17:21:30
43
原创 leetcode 141. 环形链表
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool hasCycle(ListNode *head) { ListNode* slow = head;
2020-09-15 16:27:11
40
原创 leetcode 136. 只出现一次的数字
class Solution {public:int singleNumber(vector<int>& nums) { map<int, int>res; for (int i = 0; i < nums.size(); i++) { res[nums[i]]++; } for (auto it = res.begin(); it != res.end(); it++) { if (it->second == 1) {
2020-09-15 16:03:10
48
原创 leetcode 94. 二叉树的中序遍历
class Solution {public: vector<int> res; vector<int> inorderTraversal(TreeNode* root) { if (root!=NULL) { inorderTraversal(root->left); res.push_back(root->val); inorderTraversal(root->right); } return res; }}
2020-09-14 19:52:59
58
原创 leetcode 637. 二叉树的层平均值
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<double> averageOfL
2020-09-12 19:58:50
87
原创 leetcode 39. 组合总和
class Solution {public:vector<int>ans;vector<vector<int>>res;void dfs(vector<int>& candidates,int index,int sum){ if (sum < 0) { return; } if (sum == 0) { res.push_back(ans); return; } for (int i = index; i
2020-09-10 20:55:16
42
原创 leetcode 40. 组合总和 II
class Solution {public:vector<int>ans;vector<vector<int>>res;void dfs(vector<int>& candidates,int index,int sum){ if (sum < 0) { return; } if (sum == 0) { res.push_back(ans); return; } for (int i = index; i
2020-09-10 20:50:02
54
原创 leetcode 60. 第k个排列
调用函数式编程(dogo)狗头保命class Solution {public: string getPermutation(int n, int k) { int a[9]={0}; string res; for(int i=0;i<n;i++) { a[i]=i+1; } int index=0; do {
2020-09-05 16:03:27
83
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人