LeetCode--1109. 航班预订统计

1109. 航班预订统计

思路：

• 数组不变，区间查询：前缀和、树状数组、线段树；
• 数组单点修改，区间查询：树状数组、线段树；
• 数组区间修改，单点查询：差分、线段树；
• 数组区间修改，区间查询：线段树。
  本题目使用差分数组即可

/**
 * 1109. 航班预订统计
 *
 */

public class Solution1109 {
  public int[] corpFlightBookings(int[][] bookings, int n) {
    int[] differenceList = new int[n + 2];
    for (int[] booking : bookings) {
      differenceList[booking[0]] +=  booking[2];
      differenceList[booking[1] + 1] -=  booking[2];
    }
    int[] res = new int[n];
    int temp = 0;
    for (int i = 1; i <= n; i++) {
      res[i - 1] = temp + differenceList[i];
      temp = res[i - 1];
    }
    return res;
  }

  public static void main(String[] args) {
    Solution1109 solution1109 = new Solution1109();
    solution1109.corpFlightBookings(new int[][]{{1,2,10}, {2,3,20}, {2,5,25}}, 5);
  }
}