1109. 航班预订统计

发表于 更新于 分类于 本文字数： 117 阅读时长 ≈ 1 分钟

统计数量而原始均为0，所以直接

理解有问题

1
diff[i]+=diff[i-1];
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#define f(i, a, b) for (int i = a; i <= b; i++)

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, int n, int* returnSize){
int *diff=(int *)malloc(sizeof(int)*(n+1));
f(i,0,n)
diff[i]=0;
f(i,0,bookingsSize-1){
    diff[bookings[i][0]-1]+=bookings[i][2];
    diff[bookings[i][1]]-=bookings[i][2];
}
f(i,1,n-1)
diff[i]+=diff[i-1];
*returnSize=n;
return diff;
}