LeetCode
文章平均质量分 56
zhc_24
这个作者很懒,什么都没留下…
展开
-
Leetcode 题目整合01
写在前面:最近一直在做一些LeetCode的题目,我之前一直是将每道题我的答案和想法以及别人优秀的答案都整合在一起然后上传的GitHub上,但是我发现这样做自己还是很难去经常复习,尤其最近发现很多之前遇到的问题再次发生。所以很有必要对一些阶段性的问题进行归纳和总结。今天遇到的是这样的题目: 题目非常的简单,就是要求输入整数的对应二进制序列的1的个数,要求o(n)的时间复杂度和o(n)的空间复杂原创 2017-12-04 19:16:13 · 172 阅读 · 0 评论 -
817. Linked List Components
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };分析:长度为N的链表 每个节点的val都不一样 取值从0-N-1 空间复杂度为O(G...原创 2018-04-25 10:37:56 · 114 阅读 · 0 评论 -
116. Populating Next Right Pointers in Each Node 题解
分析:给出一个完全二叉树,给每个节点的next指针连接向其右边的节点,如果没有右边的节点那么就指向nullptr 附加条件是不能使用额外空间 所以不可以使用自定义的栈空间 可以使用调用栈进行存储- 方法1:使用递归的方式,遍历当前层的时候处理好下一层每个节点的next- 方法2:迭代方式,一样的逻辑处理。/** * Definition for binary tre...原创 2018-05-17 16:12:24 · 167 阅读 · 0 评论 -
41. First Missing Positive 分析
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant space...原创 2018-05-18 13:14:40 · 1313 阅读 · 0 评论 -
42. Trapping Rain Water
42. Trapping Rain Water参考:LeetCode Monotone Stack Summary 单调栈小结Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to t...原创 2018-10-12 20:54:48 · 937 阅读 · 0 评论 -
84. Largest Rectangle in Histogram
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.参考一下大神的总结:LeetCode Monotone Stack Summary ...原创 2018-10-12 22:18:16 · 369 阅读 · 0 评论 -
85. Maximal Rectangle
Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.Input:[[“1”,“0”,“1”,“0”,“0”],[“1”,“0”,“1”,“1”,“1”],[“1”,“1”,“1”,“1”,“1”],[“1...原创 2018-10-12 22:36:43 · 139 阅读 · 0 评论 -
股票买卖最大收益总结-Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock IIISay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at mo...原创 2018-10-13 17:08:51 · 645 阅读 · 0 评论 -
97. Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.Example 1:Input: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac”Output: trueExample 2:Input: s1 = “aabcc”, s2 = “dbbca”,...原创 2018-10-14 11:02:19 · 494 阅读 · 0 评论