1.加油站
1.1 题目
. - 力扣(LeetCode)
1.2 题解
class Solution
{
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost)
{
int curSum = 0;
int totalSum = 0;
int start = 0;
for (int i = 0; i < gas.size(); i++)
{
curSum += gas[i] - cost[i];
totalSum += gas[i] - cost[i];
if (curSum < 0)
{
start = i + 1;
curSum = 0;
}
}
if (totalSum < 0)
{
return -1;
}
return start;
}
};
2.分发糖果
2.1 题目
. - 力扣(LeetCode)
2.2 题解
class Solution {
public:
int candy(vector<int>& ratings)
{
vector<int> candy(ratings.size(), 1);
//右边比左边得分高
for (int i = 0; i < ratings.size(); i++)
{
if (i > 0 && ratings[i] > ratings[i - 1])
{
candy[i] = 1 + candy[i - 1];
}
}
//左边比右边得分高,从右边开始遍历
for (int i = ratings.size() - 1; i >= 0; i--)
{
if (i< ratings.size() - 1 && ratings[i]>ratings[i + 1])
{
candy[i] = max(candy[i + 1] + 1, candy[i]);
}
}
int sum = 0;
for (auto& i : candy)
{
sum += i;
}
return sum;
}
};
3.柠檬水找零
3.1 题目
. - 力扣(LeetCode)
3.2 题解
class Solution {
public:
bool lemonadeChange(vector<int>& bills)
{
int five = 0;
int ten = 0;
int twenty = 0;
for (auto bill : bills)
{
//情况1、不用找零
if (bill == 5)five++;
//情况2、找一张5
if (bill == 10)
{
//没有5元的零钱
if (five <= 0)return false;
five--;
ten++;
}
//情况3、收到的是20优先找一张10块和一张5块
if (bill == 20)
{
if (five > 0 && ten > 0)
{
five--;
ten--;
twenty++;
}
else if (five >= 3)
{
five -= 3;
twenty++;
}
else return false;
}
}
return true;
}
};
4.根据身高重建队列
4.1 题目
. - 力扣(LeetCode)
4.2 题解
class Solution
{
public:
vector<vector<int>> reconstructQueue(vector<vector<int>>& people)
{
//身高从大到小排列,如果身高一样,根据第二个从小到大排序
sort(people.begin(), people.end(), [](vector<int>& a, vector<int>& b) {if (a[0] == b[0]) { return a[1] < b[1]; }; return a[0] > b[0]; });
vector<vector<int>> que;
for (int i = 0; i < people.size(); i++)
{
int postion = people[i][1];
que.insert(que.begin() + postion, people[i]);
}
return que;
}
};