day31 贪心.p1

- 455.分发饼干 
```cpp
class Solution {

public:

    int findContentChildren(vector<int>& g, vector<int>& s) {

        sort(g.begin(), g.end());

        sort(s.begin(), s.end());

        int count = 0;

        for (int i = 0, j = 0; i < s.size() && j < g.size(); i++) {

            if (s[i] >= g[j]) {

                count++;

                j++;

            }

        }

        return count;

    }

};
```
- 376. 摆动序列 
```cpp
class Solution {

public:

    int wiggleMaxLength(vector<int>& nums) {

        int preDiff = 0, curDiff = 0, reslut = 1;

        for (int i = 0; i < nums.size() - 1; i++) {

            curDiff = nums[i + 1] - nums[i];

            if ((curDiff < 0 && preDiff >= 0) || (curDiff > 0 && preDiff <= 0)) {

                reslut++;

                preDiff = curDiff;

            }

        }

        return reslut;

    }

};
```
- 53. 最大子序和
```cpp
class Solution {

public:

    int maxSubArray(vector<int>& nums) {

        int sum = 0, result = INT_MIN;

        for (int i = 0; i < nums.size(); i++) {

            sum += nums[i];

            result = sum > result ? sum : result;

            if (sum < 0) {

                sum = 0;

            }

        }

        return result;

    }

};
```