7.6笔记

704.二分查找：

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        a = 0
        b = len(nums) - 1
        while a <= b:
            mid = (a+b)//2
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                b = mid - 1
            else:
                a = mid + 1
        return -1  

复习1.120 三角形最小路径和：

class Solution:
    def minimumTotal(self, triangle: List[List[int]]) -> int:
        if not triangle:
            return 0
        a = len(triangle)
        for i in range(a-1,0,-1):
            for j in range(i):
                triangle[i-1][j] = min(triangle[i][j]+triangle[i-1][j],triangle[i-1][j] + triangle[i][j+1])
        return triangle[0][0]

复习2.买卖股票的最佳时机：

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if not prices:
            return 0
        res = 0
        min1 = prices[0]
        for i in range(1,len(prices)):
            min1 = min(min1,prices[i])
            res = max(res,prices[i]-min1)
        return res