每日刷题--贪心算法

```python
###121. 买卖股票的最佳时机
class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        cost, profit= float('inf'),0
        for p in prices:
            cost = min(cost,p)
            profit = max(profit, p-cost)
        return profit
##动态规划
class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        n = len(prices)
        dp = [0] * n
        minprice = prices[0]
        if n == 0: return 0
        for i in range(1,n):
            minprice = min(minprice, prices[i])
            dp[i] = max(dp[i-1],prices[i]-minprice)
        return dp[-1]
```



```python
###55. 跳跃游戏
##贪心算法
class Solution:
    def canJump(self, nums) :
        max_i = 0#初始化当前能到达最远的位置
        for i, jump in enumerate(nums):#i为当前位置，jump是当前位置的跳数
            if max_i>=i and i+jump>max_i:#如果当前位置能到达，并且当前位置+跳数>最远位置  
                max_i = i+jump  #更新最远能到达位置
        return max_i>=i
##动态规划
class Solution:
    def canJump(self, nums: List[int]) -> bool:
        n = len(nums)
        dp = [0]*n
        dp[0] = nums[0]
        for i in range(1,n):
            if dp[i-1]>=i: dp[i] = max(dp[i-1],i+nums[i])
            else: dp[i] = dp[i-1]
        return dp[-1]>=len(nums)-1
```



```python
###45. 跳跃游戏 II
##动态规划和贪心算法
class Solution:
    def jump(self, nums: List[int]) -> int:
        n = len(nums)
        dp = [0]*n
        j = 0#指针来记录上一个最短到达的位置
        for i in range(1,n):
            while j + nums[j] <i:##j+nums[j]是可以到达的位置
                j+=1
            dp[i] = dp[j]+1
        return dp[-1]
class Solution:
    def jump(self, nums: List[int]) -> int:
        if len(nums) <= 1:
            return 0
        last_position = 0
        far = nums[0]
        step = 1
        while far < len(nums)-1:
            step += 1
            tmp = far
            for i in range(last_position, tmp+1):
                far = max(far, nums[i]+i)
                if far >= len(nums)-1:
                    return step
            last_position = tmp
        return step
```



```python
###763. 划分字母区间
class Solution:
    def partitionLabels(self, s: str) -> List[int]:
        dic = {s: index for index,s in enumerate(s)}
        num = 0
        result = []
        j = dic[s[0]]
        for i in range(len(s)):
            num+=1
            if dic[s[i]] > j:
                j = dic[s[i]]
            if i == j:
                result.append(num)
                num = 0
        return result

```