-
Notifications
You must be signed in to change notification settings - Fork 0
/
CorporateFlightBooking.cpp
53 lines (43 loc) · 1.5 KB
/
CorporateFlightBooking.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// CODING NINJAS OR LEERCODE
// Corporate Flight Bookings
// https://leetcode.com/problems/corporate-flight-bookings/description/
// https://www.codingninjas.com/studio/problem-details/corporate-flight-bookings_1466958
// There are n flights that are labeled from 1 to n.
// You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi] represents a booking for flights firsti through lasti (inclusive) with seatsi seats reserved for each flight in the range.
// Return an array answer of length n, where answer[i] is the total number of seats reserved for flight i.
// Example 1:
// Input: bookings = [[1,2,10],[2,3,20],[2,5,25]], n = 5
// Output: [10,55,45,25,25]
// Explanation:
// Flight labels: 1 2 3 4 5
// Booking 1 reserved: 10 10
// Booking 2 reserved: 20 20
// Booking 3 reserved: 25 25 25 25
// Total seats: 10 55 45 25 25
// Hence, answer = [10,55,45,25,25]
// Example 2:
// Input: bookings = [[1,2,10],[2,2,15]], n = 2
// Output: [10,25]
// Explanation:
// Flight labels: 1 2
// Booking 1 reserved: 10 10
// Booking 2 reserved: 15
// Total seats: 10 25
// Hence, answer = [10,25]
vector<int> corpFlightBookings(vector<vector<int>> &bookings, int n)
{
vector<int> res(n);
for (auto &v : bookings)
{
res[v[0] - 1] += v[2];
if (v[1] < n)
{
res[v[1]] -= v[2];
}
}
for (int i = 1; i < n; ++i)
{
res[i] += res[i - 1];
}
return res;
}