greedy
文章平均质量分 54
Ulricalin
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Course Schedule III
There are n different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dth day. A course should be taken continuously for t days and must be finished be原创 2017-10-20 00:02:36 · 335 阅读 · 0 评论 -
Best Time to Buy and Sell Stock l, II, lll
Say 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 sell one share of the stock), d原创 2018-01-11 20:07:54 · 319 阅读 · 0 评论 -
738. Monotone Increasing Digits
Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits. (Recall that an integer has monotone increasing digits if and only if each pai原创 2017-12-31 21:58:47 · 281 阅读 · 0 评论
分享