![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
哲学加农炮
这个作者很懒,什么都没留下…
展开
-
solution_169
LeetCode Problem 169原创 2017-09-19 14:15:22 · 284 阅读 · 0 评论 -
solution_474
LeetCode Problem DescriptionIn the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n原创 2018-01-20 11:44:43 · 122 阅读 · 0 评论 -
Exercise8.3
习题8.3 首先我们可以在多项式时间里验证STINGY SAT的解,所以它是 NP problem,满足条件。可以通过将 k 设为所有变量的总个数,将 SAT 归约到 STINGY SAT,所以也满足条件。由此可得STINGY SAT是一个NP-complete problem。原创 2018-01-21 21:28:03 · 126 阅读 · 0 评论 -
solution_123
LeetCode Problem DescriptionSay 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 most two tran原创 2018-01-21 21:05:50 · 316 阅读 · 0 评论 -
solution_122
LeetCode Problem DescriptionSay 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 as many transact原创 2018-01-21 21:04:13 · 95 阅读 · 0 评论 -
solution_121
LeetCode Problem DescriptionSay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and s原创 2018-01-21 21:01:30 · 123 阅读 · 0 评论 -
solution_63
LeetCode Problem DescriptionFollow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 an原创 2018-01-21 20:56:38 · 123 阅读 · 0 评论 -
solution_55
LeetCode Problem DescriptionGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at t原创 2018-01-21 20:54:56 · 112 阅读 · 0 评论 -
solution_45
LeetCode Problem DescriptionGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at t原创 2018-01-21 20:48:57 · 123 阅读 · 0 评论 -
solution_452
LeetCode Problem Description原创 2018-01-04 00:26:37 · 133 阅读 · 0 评论 -
solution_455
LeetCode Problem 455原创 2018-01-03 01:27:00 · 106 阅读 · 0 评论 -
solution_746
LeetCode Problem 746原创 2018-01-02 01:07:23 · 119 阅读 · 0 评论 -
solution_740
LeetCode Problem 740原创 2018-01-02 01:05:53 · 116 阅读 · 0 评论 -
solution_718
LeetCode Problem 718原创 2018-01-02 01:05:19 · 117 阅读 · 0 评论 -
solution_101
LeetCode Problem 101 2原创 2017-10-02 00:12:26 · 204 阅读 · 0 评论 -
solution_229
LeetCode Problem 229原创 2017-09-23 22:19:08 · 144 阅读 · 0 评论 -
solution_455
LeetCode Problem DescriptionAssume 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, whic原创 2018-01-20 11:46:22 · 111 阅读 · 0 评论