代码随想三刷贪心篇1

455. 分发饼干

题目

链接

代码

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

376. 摆动序列

题目

链接

代码

class Solution {
    public int wiggleMaxLength(int[] nums) {
        if(nums.length<=1){
            return nums.length;
        }

        int curSub = 0;
        int preSub = 0;
        int count =1;
        for(int i =1;i<nums.length;i++){
            curSub = nums[i] - nums[i-1];
            if( (preSub<=0&&curSub>0)|| (preSub>=0&&curSub<0) ){
                count++;
                preSub = curSub;
            }
        }
        return count;
    }
}

53. 最大子数组和

题目

链接

代码

class Solution {
    public int maxSubArray(int[] nums) {

        int max = nums[0];
        int sum =0;
        for(int i = 0;i<nums.length;i++){
            sum+=nums[i];
            if(sum<=0){
                sum = 0;
                max = Math.max(max,nums[i]);
            }else{
                max = Math.max(max,sum);
            }
        }
        return max;
    }
}