最小未被占据椅子的编号

最小未被占据椅子的编号

解法：最小堆+哈希表

我们需要一个数据结构来维护未被占据的椅子，且该数据结构需要在较低的时间复杂度内实现查询并弹出最小值与插入元素操作，我们可以用一个最小堆实现的优先队列来维护。

# coding=utf-8
from collections import defaultdict
from heapq import heappush, heappop
# 其他： heapify(heap) 让列表具备堆特征。

def min_desk(times, targetFriend):
    n = len(times)
    arrival = []
    leaving = []
    for i in range(n):
        arrival.append((times[i][0], i))
        leaving.append((times[i][1], i))

    arrival.sort(key=lambda x: x[0])
    leaving.sort(key=lambda x: x[0])
    available = list(range(n))  # 未被占据的椅子
    seats = {}  # 占据的椅子及人
    j = 0
    for time, person in arrival:
        while j < n and leaving[j][0] <= time:
            heappush(available, seats[leaving[j][1]])  # heappush用于在堆中添加一个元素
            j += 1
        seat = heappop(available)  # heappop用于从栈中弹出最小的元素
        seats[person] = seat
        if person == targetFriend:
            return seat
    return -1


times = [[1, 4], [2, 3], [4, 6]]
targetFriend = 1

print(min_desk(times, targetFriend))