greedy
Vendredimatin
这个作者很懒,什么都没留下…
展开
-
Leetcode 121. Best Time to Buy and Sell Stock
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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit. Note tha原创 2020-07-05 10:40:27 · 101 阅读 · 0 评论 -
Leetcode 55. Jump Game
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. Determine if you ...原创 2019-06-22 15:33:39 · 205 阅读 · 0 评论