![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Algorithm
文章平均质量分 70
狗狗7号
这个作者很懒,什么都没留下…
展开
-
Leetcode45 hard
Given 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 that position. Your goal i原创 2016-10-31 14:39:18 · 205 阅读 · 0 评论 -
Leetcode123 hard
Say 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 transactions. 解析:很容易想出将原有数组分为两个原创 2016-10-31 15:27:53 · 223 阅读 · 0 评论