演算法

1type Meeting = [number, number]; // [start, end)
2 
3function maxMeetings(meetings: Meeting[]): Meeting[] {
4  const sorted = [...meetings].sort((a, b) => a[1] - b[1] || a[0] - b[0]);
5  const chosen: Meeting[] = [];
6  let lastEnd = -Infinity;
7  for (const [start, end] of sorted) {
8    if (start < lastEnd) continue;
9    chosen.push([start, end]);
10    lastEnd = end;
11  }
12  return chosen;
13}
14 
15function greedyChange(coins: number[], amount: number): number[] | null {
16  const used: number[] = [];
17  for (const coin of [...coins].sort((a, b) => b - a)) {
18    while (amount >= coin) {
19      used.push(coin);
20      amount -= coin;
21    }
22  }
23  return amount === 0 ? used : null;
24}