力扣860.柠檬水找零
class Solution {
public boolean lemonadeChange(int[] bills) {
int num5 = 0;
int num10 = 0;
for(int i = 0; i < bills.length; i++) {
if(bills[i] == 5) {
num5++;
}
else if(bills[i] == 10) {
num5--;
if(num5 < 0) return false;
num10++;
}
else {
if(num5 > 0 && num10 > 0) {
num5--;
num10--;
}
else if(num5 >= 3 && num10 == 0) {
num5 -= 3;
}
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];
else 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][2]);
}
}
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;
}
}