代码随想录训练营第三十二天｜贪心算法

class Solution {
    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        int n = g.length;
        int m = s.length;
        if(m==0||n==0){
            return 0;
        }
        int res = 0;
        int j = 0;
        for(int i = 0; i<n; i++){
            if(j>m-1){
                return res;
            }
            while(g[i]>s[j]){
                j++;
                if(j>m-1){
                   return res;
            }
               
           }
            j++;
            res++;
        }
        return res;
    }
}

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

class Solution {
    public int maxSubArray(int[] nums) {
        int n = nums.length;
        if(n==1){
            return nums[0];
        }
        int res = nums[0];


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



    }
}