【Leetcode】1109. Corporate Flight Bookings

题目地址：

https://leetcode.com/problems/corporate-flight-bookings/

给定一个$0$数组$A$，然后执行若干次操作，每次操作将$A$的第$i$到第$j$个数字都加上某个数字$x$，问结果数组。

思路是差分数组，可以以$O(1)$的时间应答每次询问。代码如下：

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

时间复杂度$O(q)$（$q$为操作次数），空间$O(n)$。