刷题训练 day27 | 第八章 贪心算法 part01

题目1：

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

题目2：

class Solution {
    public int wiggleMaxLength(int[] nums) {
        int result=1; //这里必须是1开始
        int prediff=0;
        int curdiff=0;
        if (nums.length<=1){
            return nums.length;
        }
        for (int i=0;i=0 && curdiff<0 || prediff<=0 && curdiff>0){
                prediff = curdiff;
                result++;
            }
        }
        return result;
        
    }
}

题目3：

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