代码随想录Day31：分发饼干、摆动序列、 最大子序和

分发饼干

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(s.begin(), s.end());//饼干尺寸
        sort(g.begin(), g.end());//胃口
        int intIndex = 0;
        for(int i = 0; i < s.size(); i++){
            if(intIndex < g.size() && s[i] >= g[intIndex]){
                intIndex++;
            }
        }
        return intIndex;
    }
};

摆动序列

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

最大子序和

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