贪心的本质是选择每一阶段的局部最优,从而达到全局最优。
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int count = 0;
int sIndex = s.length - 1;
for (int i = g.length - 1; i >= 0; i--) {
if (sIndex >= 0 && g[i] <= s[sIndex]) {
count++;
sIndex--;
}
}
return count;
}
}
class Solution {
public int wiggleMaxLength(int[] nums) {
if (nums.length <= 1) {
return nums.length;
}
int curDiff = 0;
int preDiff = 0;
int count = 1;
for (int i = 1; i < nums.length; i++) {
curDiff = nums[i] - nums[i - 1];
if ((curDiff > 0 && preDiff <= 0