![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
baidu_36282128
这个作者很懒,什么都没留下…
展开
-
445[Easy]:Assign Cookies
Part1:题目描述Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the min原创 2017-10-17 21:35:52 · 170 阅读 · 0 评论 -
740[Medium]:Delete and Earn
生命不息,奋斗不止,要多动脑子!原创 2017-12-07 12:23:44 · 487 阅读 · 0 评论 -
747[Easy] :Min Cost Climbing Stairs
要保持定期打代码的习惯,手才不会生原创 2018-01-03 09:26:47 · 135 阅读 · 0 评论 -
53[Easy]:Maximum Subarray
简单的动态规划,虽然还是思考了一段时间才有思路但是总算有进步了原创 2018-01-13 10:22:04 · 141 阅读 · 0 评论 -
169[Esay]:Majority Element
题目描述:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majo原创 2017-10-09 14:21:07 · 142 阅读 · 0 评论 -
698[Medium]: Partition to K Equal Sum Subsets
Part1:题目描述Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all equal.Example 1:Input: n原创 2018-01-09 21:21:45 · 208 阅读 · 0 评论 -
516[Medium]: Longest Palindromic Subsequence
Part1:题目描述Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1:Input:"bbbab"Output:4One possible long原创 2018-01-20 17:14:32 · 142 阅读 · 0 评论 -
98[Medimu]: Validate Binary Search Tree
这道题的代码还是挺值得仔细去想的原创 2018-01-20 17:51:15 · 117 阅读 · 0 评论 -
NP-complete证明
Part1:题目描述 In the EXACT 4SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals, and such that each variable occurs at most once in each clause. The goa原创 2018-01-20 21:35:12 · 563 阅读 · 0 评论 -
714[Medium]: Best Time to Buy and Sell Stock with Transaction Fee
动态规划还是要继续加油!原创 2017-12-13 09:14:59 · 168 阅读 · 0 评论 -
673[Medium]: Number of Longest Increasing Subsequence
动态规划的方程很重要呀!原创 2017-12-02 19:31:53 · 138 阅读 · 0 评论 -
215[Medium]:Kth Largest Element in an Array
欢迎大家指正~原创 2017-10-04 19:15:59 · 182 阅读 · 0 评论 -
668[Hard]:Kth Smallest Number in Multiplication Table
这个题目算然最终的代码挺简洁,但是一开始不好想到解题思路,需要多看几遍原创 2017-10-13 21:08:00 · 237 阅读 · 0 评论 -
524[Medium] :Longest Word in Dictionary through Deleting
感觉考虑问题需要灵活地去转换角度原创 2017-10-21 16:22:52 · 222 阅读 · 0 评论 -
513[Medium]:Find Bottom Left Tree Value
之前一直不太敢打tree的题目,总有一种恐惧感,现在我要慢慢战胜这只拦路虎。一起加油~原创 2017-11-02 15:13:16 · 134 阅读 · 0 评论 -
515[Medium]:Find Largest Value in Each Tree Row
求帮忙解答我的一个小问题!!!原创 2017-11-03 09:07:25 · 120 阅读 · 0 评论 -
148[Medium]: Sort List
这个写的太水了,以后要继续补充原创 2017-11-03 23:12:47 · 130 阅读 · 0 评论 -
712[Medium]: Minimum ASCII Delete Sum for Two Strings
动态规划的题目,继续加油原创 2017-11-28 22:51:36 · 135 阅读 · 0 评论 -
718[Medium]:Maximum Length of Repeated Subarray
最长公共字串是动态规划里的典型问题,希望自己通过这篇博客真正把这个问题搞懂。原创 2017-11-23 09:30:02 · 159 阅读 · 0 评论 -
392[Medium]: Is Subsequence
据说要用贪心原创 2018-01-20 22:28:38 · 190 阅读 · 0 评论