代码随想录算法打卡第三十天, 新手自我记录一下刷题历程, 仅为自我打卡使用.
860.柠檬水找零
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) {
five--;
ten++;
}
if (bills[i] == 20) {
if (ten > 0) {
five--;
ten--;
} else {
five -= 3;
}
}
if (five < 0 || ten < 0) return false;
}
return true;
}
};
406.根据身高重建队列
class Solution {
private:
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);
list<vector<int>> que;
for (int i = 0; i < people.size(); ++i) {
int position = people[i][1];
list<vector<int>>::iterator it = que.begin();
while (position--) {
it++;
}
que.insert(it, people[i]);
}
return vector<vector<int>>(que.begin(), que.end());
}
};
452. 用最少数量的箭引爆气球
class Solution {
private:
static bool cmp(vector<int>& a, vector<int>& b) {
return a[0] < b[0];
}
public:
int findMinArrowShots(vector<vector<int>>& points) {
sort(points.begin(), points.end(), cmp);
if (points.size() == 0) return 0;
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], points[i - 1][1]);
}
}
return result;
}
};
希望还能坚持一天!