代码随想录算法训练营day35 | 455、分发饼干

最新推荐文章于 2024-08-12 22:00:45 发布

weixin_55493403

最新推荐文章于 2024-08-12 22:00:45 发布

阅读量1k

点赞数

文章标签：算法 leetcode c++

本文链接：https://blog.csdn.net/weixin_55493403/article/details/130208804

版权

455、分发饼干

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

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