代码随想录Day27_贪心1

分发饼干

代码

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

摆动序列

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

            // for(int i=0;i<Diff.size()-1;i++)
            if ((Diff > 0 && preDiff <=0 )|| (Diff < 0 && preDiff >= 0)) {
                count++;
                preDiff = Diff;
            }
        }
        return count;
    }
};