代码随想录第27天 | 455.分发饼干、376. 摆动序列、53. 最大子序和

455.分发饼干

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

376. 摆动序列

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

53. 最大子序和

    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;
    }