860.柠檬水找零
题目链接:860.柠檬水找零
文档链接:860.柠檬水找零
视频链接:贪心算法,看上去复杂,其实逻辑都是固定的!LeetCode:860.柠檬水找零
C++实现
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 > 0) {
five--;
ten++;
} else
return false;
}
if (bills[i] == 20) {
if (ten > 0 && five > 0) {
ten--;
five--;
} else {
if (five >= 3) {
five = five - 3;
} else
return false;
}
}
}
return true;
}
};
406.根据身高重建队列
题目链接:406.根据身高重建队列
文档链接:406.根据身高重建队列
视频链接:贪心算法,不要两边一起贪,会顾此失彼 | LeetCode:406.根据身高重建队列
C++实现
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;
list<vector<int>> que;
for (int i = 0; i < people.size(); i++) {
int position = people[i][1];
/*
que.insert(que.begin() + position, people[i]);
*/
list<vector<int>>::iterator it = que.begin();
while (position--) {
it++;
}
que.insert(it, people[i]);
}
return vector<vector<int>>(que.begin(), que.end());
}
};
452. 用最少数量的箭引爆气球
题目链接:452. 用最少数量的箭引爆气球
文档链接:452. 用最少数量的箭引爆气球
视频链接:贪心算法,判断重叠区间问题 | LeetCode:452.用最少数量的箭引爆气球
C++实现
class Solution {
private:
static bool cmp(const vector<int>& a, const 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 count = 1;
for (int i = 1; i < points.size(); i++) {
if (points[i][0] > points[i - 1][1]) {
count++;
} else {
points[i][1] = min(points[i][1], points[i - 1][1]);
}
}
return count;
}
};