建筑行业综合查询平台,优化推广联盟,注册安全工程师难吗,有效获客的六大渠道目录 Leetcode860.柠檬水找零Leetcode406.根据身高重建队列Leetcode452. 用最少数量的箭引爆气球 Leetcode860.柠檬水找零 文章链接 #xff1a;代码随想录 题目链接#xff1a;860.柠檬水找零 class Solution {
public:bool lemonadeChange(vectorint bills) {… 目录 Leetcode860.柠檬水找零Leetcode406.根据身高重建队列Leetcode452. 用最少数量的箭引爆气球 Leetcode860.柠檬水找零 文章链接 代码随想录 题目链接860.柠檬水找零 class Solution {
public:bool lemonadeChange(vectorint 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) {five--;ten;}if (bills[i] 20){if (ten 0){ten--;five--;}else{five - 3;}}if (five 0 || ten 0) return false;}return true;}
};Leetcode406.根据身高重建队列 文章链接代码随想录 题目链接406.根据身高重建队列 使用vectorinsert时可能发生扩容拷贝费时
class Solution {
public:static bool cmp(vectorint a, vectorint b){if (a[0] b[0]) return a[1] b[1];return a[0] b[0];}vectorvectorint reconstructQueue(vectorvectorint people) {sort(people.begin(), people.end(), cmp);vectorvectorint que;for (int i 0; i people.size(); i){int position people[i][1];que.insert(que.begin() position, people[i]);}return que;}
};使用链表效率比vector快
class Solution {
public:static bool cmp(vectorint a, vectorint b){if (a[0] b[0]) return a[1] b[1];return a[0] b[0];}vectorvectorint reconstructQueue(vectorvectorint people) {sort(people.begin(), people.end(), cmp);listvectorint que;for (int i 0; i people.size(); i){int position people[i][1];auto it que.begin();while(position--) it;que.insert(it, people[i]);}return vectorvectorint(que.begin(), que.end());}
};Leetcode452. 用最少数量的箭引爆气球 文章链接代码随想录 题目链接452. 用最少数量的箭引爆气球 区间问题注意如何排序和更新xend。
class Solution {
public:static bool cmp(vectorint a, vectorint b){if (a[0] b[0]) return a[1] b[1];return a[0] b[0];}int findMinArrowShots(vectorvectorint points) {sort(points.begin(), points.end(), cmp);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;}
};第三十五天打卡今天猛学操作系统加油
