友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
1109. 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 解题思路一样。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
/**
* @author D瓜哥 · https://www.diguage.com
* @since 2024-07-05 15:17:57
*/
public int[] corpFlightBookings(int[][] bookings, int n) {
if (bookings == null || bookings.length == 0) {
return new int[n];
}
int[] flights = new int[n];
for (int[] book : bookings) {
int start = book[0] - 1;
int end = book[1];
int val = book[2];
flights[start] += val;
if (end < n) {
flights[end] -= val;
}
}
for (int i = 1; i < n; i++) {
flights[i] += flights[i - 1];
}
return flights;
}