mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
46 lines
1.8 KiB
HTML
46 lines
1.8 KiB
HTML
<p>There are <code>n</code> flights that are labeled from <code>1</code> to <code>n</code>.</p>
|
|
|
|
<p>You are given an array of flight bookings <code>bookings</code>, where <code>bookings[i] = [first<sub>i</sub>, last<sub>i</sub>, seats<sub>i</sub>]</code> represents a booking for flights <code>first<sub>i</sub></code> through <code>last<sub>i</sub></code> (<strong>inclusive</strong>) with <code>seats<sub>i</sub></code> seats reserved for <strong>each flight</strong> in the range.</p>
|
|
|
|
<p>Return <em>an array </em><code>answer</code><em> of length </em><code>n</code><em>, where </em><code>answer[i]</code><em> is the total number of seats reserved for flight </em><code>i</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> bookings = [[1,2,10],[2,3,20],[2,5,25]], n = 5
|
|
<strong>Output:</strong> [10,55,45,25,25]
|
|
<strong>Explanation:</strong>
|
|
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>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> bookings = [[1,2,10],[2,2,15]], n = 2
|
|
<strong>Output:</strong> [10,25]
|
|
<strong>Explanation:</strong>
|
|
Flight labels: 1 2
|
|
Booking 1 reserved: 10 10
|
|
Booking 2 reserved: 15
|
|
Total seats: 10 25
|
|
Hence, answer = [10,25]
|
|
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>1 <= bookings.length <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>bookings[i].length == 3</code></li>
|
|
<li><code>1 <= first<sub>i</sub> <= last<sub>i</sub> <= n</code></li>
|
|
<li><code>1 <= seats<sub>i</sub> <= 10<sup>4</sup></code></li>
|
|
</ul>
|