第31天 Greedy 455、376、53

455. Assign Cookies

• 每次先喂小胃口
• Time Complexity: O(nlogn)

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

376. Wiggle Subsequence

• prev<=0 && cur>0 || prev>=0 && cur<0 里prev可以考虑=0，因为最开始prev是0，后面每次判断cur都不包括=0，prev又会被更新为cur，所以后面的prev一定不会出现=0
• 开始的count=1，因为nums=[1] 一个数也有一个count
• Time Complexity: O(n)

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

• 方法2: DP
• top[i] 到i位置是波峰的wiggle subsequence的最长长度
• bottom[i]: 到i位置是波谷的wiggle subsequence的最长长度
• return Math.max(top[nums.length-1], bottom[nums.length-1]); to find the max. wiggle subsequence length
• Time Complexity: O(n)
• Space Complexity: O(n) -> can use two int instead of two int[] to reduce space complexity

class Solution {
    public int wiggleMaxLength(int[] nums) {
        int[] top = new int[nums.length];
        int[] bottom = new int[nums.length];
        top[0] = 1;
        bottom[0] = 1;
        for (int i=1; i<nums.length; i++) {
            if (nums[i] > nums[i-1]) {
                top[i] = bottom[i-1]+1;
                bottom[i] = bottom[i-1];
            } else if (nums[i] < nums[i-1]) {
                top[i] = top[i-1];
                bottom[i] = top[i-1]+1;
            } else {
                top[i] = top[i-1];
                bottom[i] = bottom[i-1];
            }
        }
        return Math.max(top[nums.length-1],bottom[nums.length-1]);
    }
}

53. Maximum Subarray

• 局部最优：当前“连续和”为负数的时候立刻放弃，从下一个元素重新计算“连续和”，因为负数加上下一个元素 “连续和”只会越来越小。
  • ​​​​​​​遍历nums，从头开始用count累积，如果count一旦加上nums[i]变为负数，那么就应该从nums[i+1]开始从0累积count了，因为已经变为负数的count，只会拖累总和。
• 局部最优的情况下，并记录最大的“连续和”，可以推出全局最优。
• Time Complexity: O(n)
• Space Complexity: O(1)

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

• 方法2: DP
• dp[i] / cur: 包括i位置的subsequence的最大值
• max: 当前所有subsequence的最大值
• Time Complexity: O(n)
• Space Complexity: O(n) -> can use int instead of int[] to reduce space complexity

class Solution {
    public int maxSubArray(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        int max = nums[0];
        for (int i=1; i<nums.length; i++) {
            dp[i] = Math.max(dp[i-1]+nums[i], nums[i]);
            if (dp[i] > max) max = dp[i];
        }
        return max;
    }
}

// Space Complexity: O(1)

class Solution {
    public int maxSubArray(int[] nums) {
        int cur = nums[0];
        int max = nums[0];
        for (int i=1; i<nums.length; i++) {
            cur = Math.max(cur+nums[i], nums[i]);
            if (cur > max) max = cur;
        }
        return max;
    }
}