代码随想录算法训练营第31天 | 455. 分发饼干、376. 摆动序列、53. 最大子数组和

455. 分发饼干

贪心思路，先用小饼干满足小胃口的人

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        int ans = 0;
        sort(g.begin(), g.end());
        sort(s.begin(), s.end());
        for (int i = 0, j = 0; i < g.size() && j < s.size(); j++) {
            if (s[j] >= g[i]) {
                i++;
                ans++;
            }
        }
        return ans;
    }
};

376. 摆动序列

贪心解法，每次差值和上一次的差值符号相反时ans++

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        // 贪心
        if (nums.size() <= 1) return nums.size();
        int cur_diff = 0;
        int pre_diff = 0;
        int ans = 1;
        for (int i = 0; i < nums.size() - 1; i++) {
            cur_diff = nums[i + 1] - nums[i];
            if ((pre_diff <= 0 && cur_diff > 0) || (pre_diff >= 0 && cur_diff < 0)){
                ans++;
                pre_diff = cur_diff;
            }
        }
        return ans;
    }
};

53. 最大子数组和

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int result = INT32_MIN;
        int count = 0;
        for (int i = 0; i < nums.size(); i++) {
            count += nums[i];
            if (count > result) {
                result = count;
            }
            if (count <= 0) count = 0; 
        }
        return result;
    }
};