Leetcode Day 31: 分发饼干 and 摆动序列 and 最大子序和

455.分发饼干

class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        res = 0
        # 先满足胃口小的小孩
        for i in range(len(s)):
            if res < len(g) and s[i] >= g[res]:
                res += 1
        return res

376. 摆动序列

class Solution:
    def wiggleMaxLength(self, nums: List[int]) -> int:
        res = 1
        cur_dif = 0
        pre_dif = 0
        for i in range(1, len(nums)):
            cur_dif = nums[i] - nums[i - 1]
            if pre_dif <= 0 and cur_dif > 0 or pre_dif >= 0 and cur_dif < 0:
                res += 1
                pre_dif = cur_dif
        return res

53. 最大子序和

 ·用-float('inf')设置一个无限小的数

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        res = -float('inf')
        count = 0
        for i in range(len(nums)):
            count += nums[i]
            if count > res:
                res = count
            if count <= 0:
                count = 0
        return res