leetcode 121\122\124

121 买卖股票的最佳时机

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if not prices: return 0
        n = len(prices)
        # dp[i][0] : 表示第i天的状态是没有股票, 获得的收益
        # dp[i][1] : 表示第i天的状态是有股票，获得的收益
        dp = [[0] *2 for _ in range(n)]
        dp[0][0] = 0
        dp[0][1] = -prices[0]
        
        
        for i in range(1,n):
            dp[i][0] = max(dp[i-1][0] , dp[i-1][1] + prices[i])
            dp[i][1] = max(dp[i-1][1], -prices[i])
        return dp[n-1][0]           

122 买卖股票的最佳时机(可以交易多次）

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if not prices: return 0
        n = len(prices)
        # dp[i][0] : 表示第i天的状态是没有股票, 获得的收益
        # dp[i][1] : 表示第i天的状态是有股票，获得的收益
        dp = [[0] *2 for _ in range(n)]
        dp[0][0] = 0
        dp[0][1] = -prices[0]
        
        
        for i in range(1,n):
            dp[i][0] = max(dp[i-1][0] , dp[i-1][1] + prices[i])
            dp[i][1] = max(dp[i-1][1], -prices[i])
        return dp[n-1][0]

124 二叉树中的最大路径和

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def __init__(self):
        self.maxPath = float(-inf) #注意当有负值时，初值设为-inf
    def maxPathSum(self, root: TreeNode) -> int:
        if not root: return 0

        # 递归，返回单边分支最大值
        def dfs(root):
            if not root: return 0

            leftMax = max(0, dfs(root.left))
            rightMax = max(0, dfs(root.right)) 

            self.maxPath = max(self.maxPath, root.val + leftMax + rightMax)

            return root.val + max(leftMax, rightMax)

        dfs(root)
        return self.maxPath