提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

前言

---

贪心的本质是选择每一阶段的局部最优，从而达到全局最优。

一、力扣455. 分发饼干

class Solution {public int findContentChildren(int[] g, int[] s) {int count = 0;Arrays.sort(g);Arrays.sort(s);for(int i = 0, j = 0; i < g.length && j < s.length ;){if(s[j] >= g[i]){i ++;j ++;count ++;}else{j ++;}}return count;}
}

二、力扣376. 摆动序列

class Solution {public int wiggleMaxLength(int[] nums) {if(nums.length == 1){return 1;}int curDiff = 0, preDiff = 0, count = 1;for(int i = 1; i < nums.length; i ++){curDiff = nums[i] - nums[i-1];if((curDiff > 0 && preDiff <= 0) || (curDiff < 0 && preDiff >= 0)){count ++;preDiff = curDiff;}}return count;}
}

三、力扣53. 最大子数组和

class Solution {public int maxSubArray(int[] nums) {if(nums.length == 1){return nums[0];}int res = Integer.MIN_VALUE;int count = 0;for(int i = 0; i < nums.length; i ++){count += nums[i];res = Math.max(res,count);if(count < 0){count = 0;}}return res;}
}