![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
canwang_sjtu
这个作者很懒,什么都没留下…
展开
-
二叉树遍历104. Maximum Depth of Binary Tree
/** * 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-11-02 15:51:44 · 179 阅读 · 0 评论 -
99. Recover Binary Search Tree
占坑还没学,学了再写原创 2016-11-06 19:26:09 · 150 阅读 · 0 评论 -
二叉树遍历应用114. Flatten Binary Tree to Linked List
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; * 可以看出是前原创 2016-11-06 20:21:51 · 197 阅读 · 0 评论 -
level遍历102. Binary Tree Level Order Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; * 奇数的时候a出对,b入队 *原创 2016-11-06 21:07:11 · 195 阅读 · 0 评论 -
层次遍历变种103. Binary Tree Zigzag Level Order Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; * 采用辅助栈还原创 2016-11-04 20:30:11 · 359 阅读 · 0 评论 -
level 遍历107. Binary Tree Level Order Traversal 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原创 2016-11-06 21:25:02 · 171 阅读 · 0 评论 -
level 遍历116. Populating Next Right Pointers in Each Node
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {原创 2016-11-06 21:43:52 · 152 阅读 · 0 评论 -
level遍历117. Populating Next Right Pointers in Each Node II
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {原创 2016-11-06 21:45:53 · 201 阅读 · 0 评论 -
栈&逆波兰150. Evaluate Reverse Polish Notation
class Solution { public: int evalRPN(vector<string>& tokens) { stack<int> dataStack; for (int i=0; i<tokens.size(); ++i) { int len = tokens[i].size();原创 2016-11-06 23:39:36 · 182 阅读 · 0 评论 -
sort 自定义
struct node{ int a; int b; double c; }; 有一个node类型的数组node arr[100],想对它进行排序:先按a值升序排列,如果a值相同,再按b值降序排列,如果b还相同,就按c降序排列。就可以写这样一个比较函数:以下是代码片段:bool cmp(node x,node y) { if(x.a!=y.a) return x.原创 2016-11-10 23:39:43 · 173 阅读 · 0 评论 -
静态成员函数和非静态成员函数的区别
静态成员函数是没有this指针的。 非静态成员函数有一个指向当前对象的指针this; 也就是在静态成员函数里,不能访问非静态成员。原创 2016-11-23 11:23:59 · 521 阅读 · 0 评论 -
二叉树遍历应用110. Balanced Binary Tree
最近代码写的巨烂,我也是醉了/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {}原创 2016-11-06 19:16:44 · 187 阅读 · 0 评论 -
二叉树遍历应用(dfs)124. Binary Tree Maximum Path Sum
“` /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }原创 2016-11-06 16:39:17 · 290 阅读 · 0 评论 -
二叉树遍历111. Minimum Depth of Binary Tree
/** * 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-11-02 16:17:10 · 162 阅读 · 0 评论 -
二叉树遍历113. Path Sum II
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ //练习的原创 2016-11-02 15:33:43 · 180 阅读 · 0 评论 -
二叉树遍历112. Path Sum
/** * 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-11-02 15:26:19 · 223 阅读 · 0 评论 -
二叉树遍历145. Binary Tree Postorder Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ //利用两原创 2016-11-04 18:34:48 · 363 阅读 · 0 评论 -
二叉树遍历94. Binary Tree Inorder Traversal
/** * 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-11-04 18:37:42 · 158 阅读 · 0 评论 -
二叉树遍历144. Binary Tree Preorder Traversal
/** * 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-11-04 18:39:33 · 167 阅读 · 0 评论 -
二叉树遍历129. Sum Root to Leaf Numbers
/** * 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-11-04 18:27:25 · 221 阅读 · 0 评论 -
重建二叉树106. Construct Binary Tree from Inorder and Postorder Traversal
/** * 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-11-04 19:30:50 · 165 阅读 · 0 评论 -
重建二叉树105. Construct Binary Tree from Preorder and Inorder Traversal
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; * 因为是**,原创 2016-11-02 17:26:37 · 219 阅读 · 0 评论 -
二叉树遍历变种101. Symmetric Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; * 其实不想写递原创 2016-11-04 21:06:41 · 245 阅读 · 0 评论 -
1.Two Sum
好久不写代码,今天开始坚持打卡。//复杂度依然是nlogn, 写oj习惯了本来想自己开节点数组,感觉有点麻烦还要自己写sort()还有find(),应该会比map快点,但是还是用map凑活吧。 class Solution { public: vector<int> twoSum(vector<int> &nums, int target) { map<int, in原创 2017-01-21 22:54:56 · 189 阅读 · 0 评论