860.柠檬水找零
class Solution {
public:
bool lemonadeChange(vector<int>& bills) {
int bill_5 =0;
int bill_10 = 0;
for(int i=0; i<bills.size();i++)
{
if(bills[i]==5) bill_5++;
else if(bills[i] == 10)
{
bill_10++;
bill_5--;
if(bill_5<0) return false;
}
else if(bills[i]==20)
{
if(bill_10>0)
{
bill_10--;
bill_5--;
}
else bill_5 -= 3;
if(bill_5<0) return false;
}
}
return true;
}
};
406.根据身高重建队列
class Solution {
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];
}
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];
std::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 {
public:
int findMinArrowShots(vector<vector<int>>& points) {
if (points.size() == 0) return 0;
sort(points.begin(), points.end(), [](vector<int>& x, vector<int>& y){return x[0]<y[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][1], points[i][1]);
}
}
return result;
}
};