Leetcode 刷题笔记1 贪心算法part01

原创已于 2025-02-24 19:47:45 修改 · 204 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #笔记 #贪心算法

于 2025-02-24 15:30:25 首次发布

leetcode 刷题笔记1 专栏收录该内容

40 篇文章

订阅专栏

贪心的真谛是从局部最优推出整体最优

leetcode455 分发饼干

class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        index = len(s) - 1
        result = 0
        for i in range(len(g) - 1, -1, -1):
            if index >= 0 and s[index] >= g[i]:
                index -= 1
                result += 1
        return result

leetcode 376 摆动序列

class Solution:
    def wiggleMaxLength(self, nums: List[int]) -> int:
        if len(nums) <= 1:
            return len(nums)
        curDiff, preDiff, result = 0, 0, 1
        for i in range(len(nums)-1):
            curDiff = nums[i + 1] - nums[i] 
            if curDiff * preDiff <= 0 and curDiff != 0:
                result += 1
                preDiff = curDiff
        return result

leetcode 53 最大子数组和

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