860.柠檬水找零
- 学习文章链接:
- 思路:见注释
- 代码:
class Solution {
public boolean lemonadeChange(int[] bills) {
int five = 0, ten = 0, twenty = 0;
for (int bill : bills) {
if (bill == 5) {
five++;
}
if (bill == 10) {
if (five > 0) {
five--;
ten++;
} else {
return false;
}
}
if (bill == 20) {
if (ten > 0 && five > 0) {
twenty++;
ten--;
five--;
} else if (five >= 3) {
five -= 3;
twenty++;
} else {
return false;
}
}
}
return true;
}
}
406.根据身高重建队列
- 学习文章链接:
- 思路:遇到两个维度的问题,先从一个维度出发再从另一个角度出发.
- 代码:
class Solution {
public int[][] reconstructQueue(int[][] people) {
Arrays.sort(people, (a, b) -> {
if (a[0] == b[0]) return a[1] - b[1];
return b[0] - a[0];
});
LinkedList<int[]> que = new LinkedList<>();
for (int[] p : people) {
que.add(p[1], p);
}
return que.toArray(new int[people.length][]);
}
}
452. 用最少数量的箭引爆气球
- 学习文章链接:
- 思路:先找重复区间,再比较上一个气球的右边界和下一个气球的左边界.
- 代码:
class Solution {
public int findMinArrowShots(int[][] points) {
Arrays.sort(points, (a, b) -> Integer.compare(a[0], b[0]));
int count = 1;
for (int i = 1; i < points.length; i++) {
if (points[i][0] > points[i - 1][1]) {
count++;
} else {
points[i][1] = Math.min(points[i - 1][1], points[i][1]);
}
}
return count;
}
}