860.柠檬水找零
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:贪心算法,看上去复杂,其实逻辑都是固定的!LeetCode:860.柠檬水找零_哔哩哔哩_bilibili
状态:未通过
代码实现:
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){
if(five < 1) return false;
five--;
ten++;
}
if(bills[i] == 20){
if(five >= 3 || (ten >= 1 && five >= 1)){
if(ten >= 1 && five >= 1){
ten--;
five--;
}
else{
five -= 3;
}
}
else{
return false;
}
}
}
return true;
}
};
406.根据身高重建队列
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:贪心算法,不要两边一起贪,会顾此失彼 | LeetCode:406.根据身高重建队列_哔哩哔哩_bilibili
状态:未通过
代码实现:
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>> result;
for(int i = 0; i < people.size(); i++){
result.insert(result.begin() + people[i][1], people[i]);
}
return result;
}
};
452. 用最少数量的箭引爆气球
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:贪心算法,判断重叠区间问题 | LeetCode:452.用最少数量的箭引爆气球_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
public:
static bool cmp(vector<int>& a, 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;
}
};