860.柠檬水找零
class Solution {
public:
bool lemonadeChange(vector<int>& bills) {
int five = 0, ten = 0, twenty = 0;
for (int bill : bills) {
if (bill == 5) five++;
if (bill == 10) {
if (five <= 0) return false;
five--;
ten++;
}
if (bill == 20) {
if (five > 0 && ten > 0) {
ten--;
five--;
twenty++;
} else if (ten <= 0 && five >= 3) {
twenty++;
five -= 3;
} else return false;
}
}
return true;
}
};
406.根据身高重建队列
先搞定一边;
思路是先根据hi从大到小排序,同时相同的值根据后面ki从小到大排;
构建que,先插入最大值,0;然后用position表示前面有多少个大值,每次插入的值都是小于等于
当前que里面的所有值的。
class Solution {
public:
static bool cmp(const vector<int>& a,const 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. 用最少数量的箭引爆气球
先排序points[i][0],然后根据points[i][1]不断缩小射这一箭的范围,也就是把这些气球的射箭位置找到;points[i][0]大于points[i - 1][1]时候,说明不重叠,需要多一只箭继续
class Solution {
public:
static bool cmp(const vector<int>& a,const vector<int>& b) {
return a[0] < b[0];
}
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;
}
};