LeetCode 1109: Corporate Flight Bookings Solution

Master LeetCode problem 1109 (Corporate Flight Bookings), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1109. Corporate Flight Bookings

Medium

Array Prefix Sum

Problem Explanation

Explanation:

We can solve this problem efficiently by using a cumulative sum approach.
We iterate through the bookings and for each booking [firsti, lasti, seatsi], we increment the answer[firsti-1] by seatsi and decrement the answer[lasti] by seatsi.
After processing all the bookings, we calculate the cumulative sum of answer array to get the final result.

Solution Code

class Solution {
    public int[] corpFlightBookings(int[][] bookings, int n) {
        int[] answer = new int[n];
        for (int[] booking : bookings) {
            answer[booking[0] - 1] += booking[2];
            if (booking[1] < n) {
                answer[booking[1]] -= booking[2];
            }
        }
        for (int i = 1; i < n; i++) {
            answer[i] += answer[i - 1];
        }
        return answer;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1109 (Corporate Flight Bookings)?

This page provides optimized solutions for LeetCode problem 1109 (Corporate Flight Bookings) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1109 (Corporate Flight Bookings)?

The time complexity for LeetCode 1109 (Corporate Flight Bookings) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1109 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1109 in Java, C++, or Python.

Back to LeetCode Solutions