题目
我的题解
class Solution {
public int[] corpFlightBookings(int[][] bookings, int n) {
int[] diff = new int[n];
for (int[] booking : bookings) {
diff[booking[0] - 1] += booking[2];
if (booking[1] < n){
diff[booking[1]] -= booking[2];
}
}
for (int i = 1; i < diff.length; i++) {
diff[i] = diff[i] + diff[i - 1];
}
return diff;
}
}