LeetCode专栏
chenshuang_1792
这个作者很懒,什么都没留下…
展开
-
LeetCode-987-二叉树的垂序遍历
C++实现:class Solution {public: map<int,vector<int> > m;// record idx unordered_map<int,int> h; //record high void preorder(int idx,TreeNode* root,int high){//前序遍历 记录位置...原创 2019-07-26 10:18:28 · 133 阅读 · 0 评论 -
LeetCode-树专题-94-105-102-236-297-543-124-173
94转载自:https://blog.csdn.net/weixin_42130471/article/details/80403114105转载自:https://blog.csdn.net/qq_40163148/article/details/89214880102转载自:https://blog.csdn.net/zhangyumengs/article/details...转载 2019-07-22 15:31:49 · 107 阅读 · 0 评论 -
LeetCode-239-滑动窗口最大值
双端队列实现:class Solution {public: vector<int> maxSlidingWindow(vector<int>& nums, int k) { vector<int>vec; deque<int>q; for(int i=0;i<nu...原创 2019-07-26 11:29:51 · 163 阅读 · 0 评论 -
LeetCode-多线程-1114
1114转载自:https://blog.csdn.net/fuxuemingzhu/article/details/95889253转载 2019-07-22 17:15:34 · 175 阅读 · 0 评论 -
LeetCode-字符串-38-49-151
38报数:class Solution { public String countAndSay(int n) { String s = "1"; int k; for (int i = 1; i < n; i++) { StringBuilder t = new StringBuilder(); ...原创 2019-08-13 15:13:24 · 116 阅读 · 0 评论 -
LeetCode53-最大子序和
分治法:class Solution {public: int maxSubArray(vector<int>& nums) { if(nums.size()==0)return 0; return helper(nums,0,nums.size()-1); } int helper(vector<int&g...原创 2019-09-17 01:09:20 · 102 阅读 · 0 评论