第一题、柠檬水找零 力扣题目链接
思路:就三种账单,都列举出来就可以了
class Solution {
public:
bool lemonadeChange(vector<int>& bills) {
int five = 0, ten = 0, twenty = 0;
for(int i=0; i < bills.size(); i++){
if(bills[i] == 5){
five++;
}
if(bills[i] == 10){
if(five <=0 ) return false;
five--;
ten++;
}
if(bills[i] == 20){
if(five > 0 && ten > 0){
ten--;
five--;
}else if(five >= 3){
five -= 3;
}else{
return false;
}
}
}
return true;
}
};
第二题、根据身高重建队列 力扣题目链接
vector耗时 136ms
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;
for(int i=0; i<people.size(); i++){
int position = people[i][1];
que.insert(que.begin()+position, people[i]);
}
return que;
}
};
list耗时24ms
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);
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());
}
};
第三题、用最少数量的箭引爆气球 力扣题目链接
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 res = 1;
for(int i = 1; i<points.size(); i++){
if(points[i][0] > points[i-1][1]){
res ++;
}else{
points[i][1] = min(points[i-1][1], points[i][1]);
}
}
return res;
}
};