0.14 贪心算法

[121. 买卖股票的最佳时机](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/?envType=study-plan-v2&envId=top-100-liked)
```python
class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        buy, sell = -inf, 0
        for price in prices:
            buy = max(buy, -price)
            sell = max(sell, buy + price)
        return sell
```
[55. 跳跃游戏](https://leetcode.cn/problems/jump-game/?envType=study-plan-v2&envId=top-100-liked)
```python
class Solution:
    def canJump(self, nums: List[int]) -> bool:
        far = 0
        n = len(nums)
        for i in range(n):
            if i > far:
                return False
            far = max(far, i + nums[i])
        return True

```
[45. 跳跃游戏 II](http://leetcode.cn/problems/jump-game-ii/?envType=study-plan-v2&envId=top-100-liked)
```python
class Solution:
    def jump(self, nums: List[int]) -> int:
        cur_far = next_far = 0
        n = len(nums)
        res = 0
        for i in range(n):
            if cur_far >= n - 1:
                break
            next_far = max(next_far, i + nums[i])
            if i == cur_far:
                cur_far = next_far
                res += 1
        return res

```
[763. 划分字母区间](https://leetcode.cn/problems/partition-labels/?envType=study-plan-v2&envId=top-100-liked)
```python
class Solution:
    def partitionLabels(self, s: str) -> List[int]:
        last = {c: i for i, c in enumerate(s)}
        res = []
        start = end = 0
        for i, c in enumerate(s):
            end = max(end, last[c])
            if i == end:
                res.append(end - start + 1)
                start = end = end + 1
        return res
```