leetcode（力扣）860. 柠檬水找零||406. 根据身高重建队列||452. 用最少数量的箭引爆气球

860. 柠檬水找零

class Solution {
public:
    bool lemonadeChange(vector<int>& bills) {
        int five=0;
        int ten=0;
        //int twenty=0;
        for(int bill:bills){
            if(bill==5){
                five++;
            }
            if(bill==10){
                if(five>0){
                    five--;
                    ten++;
                }
                else{
                    return false;
                }
            }
            if(bill==20){
                if(ten>0&&five>0){
                    five--;
                    ten--;
                }
                else if(five>=3){
                    five-=3;
                }
                else{
                    return false;
                }
            }
        }
        return true;

    }
};

406. 根据身高重建队列

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

          return que;
    }
};

452. 用最少数量的箭引爆气球

class Solution {
static bool cmp(vector<int>& a,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 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;
    }
};