[自我记录]随想录刷题第二十七天 | 455.分发饼干, 376. 摆动序列, 53. 最大子序和

代码随想录算法打卡第二十七天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

---

455.分发饼干

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

---

376. 摆动序列

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        int preDiff = 0;
        int curDiff = 0; 
        int result = 1;
        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;
    }
};

---

53. 最大子数组和

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int result = INT_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;
    }
};

---

希望能再刷一天!