LeetCode860.柠檬水找零
题目链接:860. 柠檬水找零 - 力扣(LeetCode)
思路:
局部贪心:优先用面额大的找零
全局贪心:全部完成找零
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;
else {
five--;
ten++;
}
}
if(bill == 20) {
if(five > 0 && ten > 0) {
five--;
ten--;
twenty++;
} else if(five >= 3) {
five -= 3;
twenty++;
} else return false;
}
}
return true;
}
};
LeetCode406.根据身高重建队列
题目链接:
思路:
局部最优:优先按身高高的people的k来插入。插入操作过后的people满足队列属性
全局最优:最后都做完插入操作,整个队列满足题目队列属性
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;
}
};
LeetCode452.用最少数量的箭引爆气球
题目链接:452. 用最少数量的箭引爆气球 - 力扣(LeetCode)
思路:
局部最优:当气球出现重叠,一起射,所用弓箭最少
全局最优:把所有气球射爆所用弓箭最少
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;//points不为空至少要一支箭
for(int i = 1; i < points.size(); i++) {
if(points[i][0] > points[i - 1][1]) {
//气球i和i - 1不挨着
result++;
}
else {
// 气球i和i-1挨着
points[i][1] = min(points[i - 1][1], points[i][1]);//更新重叠气球最小右边界
}
}
return result;
}
};