day27 （代码随想录补卡）455.分发饼干|376. 摆动序列|53. 最大子序和

qq_38788700

已于 2024-08-30 16:39:25 修改

阅读量212

点赞数 3

文章标签： leetcode 算法

于 2024-08-30 16:39:24 首次发布

本文链接：https://blog.csdn.net/qq_38788700/article/details/141721675

版权

455.分发饼干

https://leetcode.cn/problems/assign-cookies/description/

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

376. 摆动序列

https://leetcode.cn/problems/wiggle-subsequence/description/

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        if (nums.size() <= 1) return nums.size();
        int curDiff = 0; 
        int preDiff = 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. 最大子序和

https://leetcode.cn/problems/maximum-subarray/submissions/559900245/

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;
    }
};