1109-corporate-flight-bookings.adoc

1109. Corporate Flight Bookings

{leetcode}/problems/corporate-flight-bookings/[LeetCode - Corporate Flight Bookings^]

There are n flights, and they are labeled from 1 to n.

We have a list of flight bookings. The i-th booking bookings[i] = [i, j, k] means that we booked k seats from flights labeled i to j inclusive.

Return an array answer of length n, representing the number of seats booked on each flight in order of their label.

Example 1:

Input: bookings = [[1,2,10],[2,3,20],[2,5,25]], n = 5
Output: [10,55,45,25,25]

Constraints:

• 1 ⇐ bookings.length ⇐ 20000

• 1 ⇐ bookings[i][0] ⇐ bookings[i][1] ⇐ n ⇐ 20000

• 1 ⇐ bookings[i][2] ⇐ 10000

思路分析

差分数组，与 1094. Car Pooling 解题思路一样。

link:{sourcedir}/_1109_CorporateFlightBookings.java[role=include]

参考资料

1. 1109. 航班预订统计 - 官方题解

2. 1109. 航班预订统计 - 【宫水三叶】一题双解 :「差分」&「线段树」（附区间求和目录）