代码随想录算法训练营第三十五天| 860.柠檬水找零 406.根据身高重建队列 452. 用最少数量的箭引爆气球

题目链接：860.柠檬水找零

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

题目链接：406.根据身高重建队列

class Solution {
public:
    static bool cmp(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(),cmp);
        vector<vector<int>> que;
        for(int i=0;i<people.size();i++)
        {
            int position=people[i][1];
            que.insert(que.begin()+position,people[i]);
        }
        return que;
    }
};

题目链接：452. 用最少数量的箭引爆气球

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