代码随想录一刷day31

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

---

一、力扣455. 分发饼干

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

二、力扣376. 摆动序列

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

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

class Solution {
    public int maxSubArray(int[] nums) {
        int result = Integer.MIN_VALUE;
        int count = 0;
        for(int i = 0; i < nums.length; i ++){
            count += nums[i];
            if(count > result){
                result = count;
            }
            if(count < 0){
                count = 0;
            }
        }
        return result;
    }
}