算法动态规划（简单）

爬梯子：斐波那契数列，没什么好说的

121. 买卖股票的最佳时机
     逻辑f(i)为以i为卖出点的最大利润，g(i)为i点的价格
     g(i-1) - g(i) > f(i-1)，f(i) = 0
     g(i-1) - g(i) < f(i - 1)，f(i) = f(i-1) + g(i) - g(i-1)

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if len(prices) < 2:
            return 0
        
        profit = [0]
        max_profit = 0
        for i in range(1,len(prices)):
            if prices[i-1] - prices[i] > profit[i-1]:
                cur_profit = 0 
            else:
                cur_profit = profit[i-1]+prices[i]-prices[i-1]
            profit.append(cur_profit)
            if cur_profit > max_profit:
                max_profit = cur_profit
        return max_profit

53. 最大子序和
    找到一个具有最大和的连续子数组
    逻辑：f(i)为以i为末尾的连续子数组的最大和
    f(i-1) < 0，f(i) = g(i)
    f(i-1) > 0, f(i) = g(i) + f(i-1)

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        if len(nums)<1:
            return sum(nums)
        
        pre_sub = nums[0]
        max_sub = nums[0]
        for i in range(1,len(nums)):
            if pre_sub < 0:
                cur_sub = nums[i]
            else:
                cur_sub = nums[i] + pre_sub
            pre_sub = cur_sub
            if max_sub < cur_sub:
                max_sub = cur_sub
        return max_sub

思路二：分治思想

198. 打家劫舍
     逻辑：f(i)为前i个金钱的最大值
     f(i) = max(f(i-1)，g(i) + f(i-2)) 此类关系会影响到相邻两个

class Solution:
    def rob(self, nums: List[int]) -> int:
        if not nums:
            return 0
        if len(nums)<=2:
            return max(nums)

        v_pre2 = nums[0]
        v_pre1 = nums[0] if nums[0] > nums[1] else nums[1]
        v_cur = 0
        v_max = 0
        for i in range(2,len(nums)):
            v_cur = v_pre2 + nums[i] if v_pre2 + nums[i] > v_pre1 else v_pre1

            if v_cur > v_max:
                v_max = v_cur

            v_pre2 = v_pre1
            v_pre1 = v_cur
        return v_max