860. 柠檬水找零 - 力扣(LeetCode)
class Solution {
public boolean lemonadeChange(int[] bills) {
int five = 0;
int ten = 0;
for (int bill : bills) {
if (bill == 5) {
five++;
} else if (bill == 10) {
if (five < 0) return false;
ten++;
five--;
} else if (bill == 20) {
if (five > 0 && ten > 0) {
five--;
ten--;
}else if (five >= 3) {
five -= 3;
} else {
return false;
}
}
}
return true;
}
}
406. 根据身高重建队列 - 力扣(LeetCode)
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];
});
List<int[]> list = new LinkedList<>();
for (int[] p : people) {
list.add(p[1], p);
}
return list.toArray(new int[people.length][]);
}
}