35代码随想录训练营day35|贪心算法part04

最新推荐文章于 2024-10-01 04:42:58 发布

花的草

最新推荐文章于 2024-10-01 04:42:58 发布

阅读量89

点赞数

分类专栏：代码随想录训练营文章标签：贪心算法算法 leetcode c++

本文链接：https://blog.csdn.net/m0_62828466/article/details/132131930

版权

代码随想录训练营专栏收录该内容

33 篇文章 0 订阅

订阅专栏

1、柠檬水找零

柠檬水找零

class Solution {
public:
    bool lemonadeChange(vector<int>& bills) {
        int five = 0, ten = 0;
        for (int i = 0; i < bills.size(); i++) {
            if (bills[i] == 5) {
                five++;
            }
            if (bills[i] == 10) {
                ten++;
                if (five <= 0) return false;
                five--;
            }
            if (bills[i] == 20) {
                if (ten > 0) {
                    ten--;
                    if (five <= 0) return false;
                    five--;
                } else if (ten <= 0) {
                    if (five < 3) return false;
                    five -= 3;
                }
            }
        }
        return true;
    }
};

2、根据身高重建队列

根据身高重建队列

class Solution {
public:
    static bool comp(vector<int>& a, vector<int>& b) {
        if (a[0] == b[0]) return a[1] < b[1];
        return a[0] > b[0];
    }
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        sort(people.begin(), people.end(), comp);
        vector<vector<int>> result;
        for (int i = 0; i < people.size(); i++) {
            int position = people[i][1];
            result.insert(result.begin() + position, people[i]);
        }
        return result;
    }
};

3、用最少数量的箭引爆气球

用最少数量的箭引爆气球

class Solution {
private:
    static bool cmp(const vector<int>& a, const vector<int>& b) {
        return a[0] < b[0];
     }
public:
    int findMinArrowShots(vector<vector<int>>& points) {
        if (points.size() == 0) return 0;
        sort(points.begin(), points.end(), cmp);
        int count = 1;
        for (int i = 1; i < points.size(); i++) {
            if (points[i][0] > points[i - 1][1]) {
                count++;
            } else {
                points[i][1] = min(points[i - 1][1], points[i][1]);
            }
        }
        return count;
    }
};