#838 · #2402 · Meeting Rooms III(会议室 III)

You are given n rooms numbered 0 to n-1 and a list of meetings [start, end]. Rooms are assigned to the lowest-numbered free room; if none is free the meeting is delayed until the earliest room frees, keeping the same duration. Return the room that hosted the most meetings (lowest index on ties). Constraints: 1 <= n <= 100, 1 <= meetings.length <= 10^5, 0 <= start < end <= 5 * 10^5.