![](https://img-blog.csdnimg.cn/20191204111321620.jpg?x-oss-process=image/resize,m_fixed,h_224,w_224)
LeetCode刷题记录
CurryCoder
个人微信公众号:CurryCoder的程序人生
技术交流QQ群:1027579432
所有代码在此https://github.com/cdlwhm1217096231,欢迎各位小伙伴star、follow、fork
个人主页:https://cdlwhm1217096231.github.io/
展开
-
【LeetCode-704 | 二分查找】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <unordered_map>#include <utility>#include <algorithm>using namespace std;// 二分法代码模板1,注意区间划分class Solution{public: // 方法.原创 2021-09-27 23:31:26 · 245 阅读 · 0 评论 -
【LeetCode-108 | 将有序数组转换为二叉搜索树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <unordered_map>#include <utility>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode *left;...原创 2021-09-07 23:43:34 · 2192 阅读 · 0 评论 -
【LeetCode-538 | 把二叉搜索树转换为累加树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <unordered_map>#include <utility>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode *left;...原创 2021-09-06 23:15:18 · 221 阅读 · 0 评论 -
【LeetCode-501 | 二叉搜索树中的众数】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <unordered_map>#include <utility>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode *left; .原创 2021-09-05 23:05:36 · 215 阅读 · 0 评论 -
【LeetCode-530 | 二叉搜索树的最小绝对差】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode *left; TreeNode *right; TreeNode() : val(0), left(nullptr.原创 2021-09-05 09:45:26 · 247 阅读 · 0 评论 -
【LeetCode-98 | 验证二叉搜索树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode *left; TreeNode *right; TreeNode() : val(0), left(nullpt..原创 2021-09-03 23:30:54 · 208 阅读 · 0 评论 -
【LeetCode-700 | 二叉搜索树中的搜索】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode *left; TreeNode *right; TreeNode() : val(0), left(nullptr.原创 2021-09-02 23:25:30 · 230 阅读 · 0 评论 -
【LeetCode-654 | 最大二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullp...原创 2021-09-01 23:18:07 · 209 阅读 · 0 评论 -
【LeetCode-513 | 找树左下角的值】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-31 23:48:37 · 197 阅读 · 0 评论 -
【LeetCode-113 | 路径总和II】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-30 22:54:26 · 206 阅读 · 0 评论 -
【LeetCode-112 | 路径总和】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-29 21:04:28 · 174 阅读 · 0 评论 -
【LeetCode-236 | 二叉树的最近公共祖先】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-29 19:58:20 · 198 阅读 · 0 评论 -
【LeetCode-105 | 从前序与中序遍历序列构造二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr).原创 2021-08-27 23:30:05 · 214 阅读 · 2 评论 -
【LeetCode-106 | 从中序与后序遍历序列构造二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr).原创 2021-08-26 23:39:49 · 230 阅读 · 0 评论 -
【LeetCode-572 | 另一棵树的子树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullp...原创 2021-08-25 23:26:31 · 196 阅读 · 0 评论 -
【LeetCode-110 | 平衡二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-24 23:12:42 · 192 阅读 · 0 评论 -
【LeetCode-222 | 完全二叉树的节点个数】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-23 23:10:26 · 200 阅读 · 0 评论 -
【LeetCode-101 | 对称二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr).原创 2021-08-22 22:35:06 · 221 阅读 · 0 评论 -
【LeetCode-617 | 合并二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr).原创 2021-08-20 22:50:13 · 202 阅读 · 0 评论 -
【LeetCode-226 | 翻转二叉树】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr).原创 2021-08-19 23:44:33 · 200 阅读 · 0 评论 -
【LeetCode-111 | 二叉树的最小深度】
#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr..原创 2021-08-18 23:33:09 · 215 阅读 · 0 评论 -
【LeetCode-515 | 在每个树行中寻找最大值】
1.题目描述2.题解#include <iostream>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0),原创 2021-08-17 23:07:15 · 206 阅读 · 0 评论 -
【LeetCode | 二叉树前、中、后序遍历{迭代法}实现】
1.前序遍历// 解题思路:利用栈的原理实现以迭代方法来前序遍历(根左右)二叉树class Solution {public: vector<int> preorderTraversal(TreeNode* root) { vector<int> result; stack<TreeNode*> st; if(root == nullptr) return result; st.push原创 2021-08-16 23:17:11 · 346 阅读 · 0 评论 -
【LeetCode-103 | 二叉树的锯齿形层序遍历】
#include <iostream>#include <vector>#include <queue>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr), right(nullptr) {} .原创 2021-08-15 18:05:37 · 204 阅读 · 0 评论 -
【LeetCode | 二叉树前、中、后序遍历{递归法}实现】
1.前序遍历#include <iostream>#include <vector>#include <queue>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr), right(nullpt原创 2021-08-15 10:34:38 · 240 阅读 · 0 评论 -
【LeetCode-199】二叉树的右视图
#include <iostream>#include <vector>#include <queue>#include <algorithm>using namespace std;struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0), left(nullptr), right(nullptr) {} ..原创 2021-08-13 23:04:59 · 239 阅读 · 0 评论 -
【LeetCode-121 | 二叉树的层序遍历】
struct TreeNode{ int val; TreeNode* left; TreeNode* right; TreeNode(): val(0),left(nullptr), right(nullptr) {} TreeNode(int x): val(x), left(nullptr), right(nullptr) {} TreeNode(int x, TreeNode* left, TreeNode* right): val(x), left(left), right(righ.原创 2021-08-12 23:07:58 · 345 阅读 · 0 评论 -
LeetCode刷题记录
Q1:给定一个包含 n 个整数的数组 nums,判断 nums 中是否存在三个元素 a,b,c ,使得 a + b + c = 0 ?找出所有满足条件且不重复的三元组。注意:答案中不可以包含重复的三元组。自己写的:暴力解决,时间复杂度太大class Solution(object): def threeSum(self, nums): nums.sort() ...原创 2019-06-25 11:25:19 · 509 阅读 · 0 评论