买卖股票的最佳时机

func maxProfit(prices []int) int {
    lenPrices := len(prices)
    if lenPrices <= 1 {
        return 0
    }
    minPrice := prices[0]
    diff := 0
    for i := 1; i < lenPrices; i++ {
        price := prices[i]
        if price < minPrice {
            minPrice = price
        }
        if price - minPrice > diff {
            diff = price - minPrice
        }

    }

    return diff
}

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        min_val = prices[0]
        diff = 0
        if len(prices) <= 1:
            return 0
        for i in range(1,len(prices)):
            price = prices[i]
            min_val = price if price < min_val else min_val
            diff = price - min_val if price - min_val > diff else diff
            
        return diff