corporate-flight-bookings

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

There are <code>n</code> flights that are labeled from <code>1</code> to <code>n</code>.

You are given an array of flight bookings <code>bookings</code>, where <code>bookings[i] = [firsti, lasti, seatsi]</code> represents a booking for flights <code>firsti</code> through <code>lasti</code> (inclusive) with <code>seatsi</code> seats reserved for each flight in the range.

Return an array <code>answer</code> of length <code>n</code>, where <code>answer[i]</code> is the total number of seats reserved for flight <code>i</code>.

&nbsp;
Example 1:

<pre>
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]
</pre>

Example 2:

<pre>
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]

</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 2 * 104</code></li>
	<li><code>1 &lt;= bookings.length &lt;= 2 * 104</code></li>
	<li><code>bookings[i].length == 3</code></li>
	<li><code>1 &lt;= firsti &lt;= lasti &lt;= n</code></li>
	<li><code>1 &lt;= seatsi &lt;= 104</code></li>
</ul>