什么是差分数组？

---

定义

对于数组 A[n]，它的差分数组为：
$$diff[i]=\{\begin{array}{ll}A[i],& i==0\\ A[i]-A[i-1],& 0<i<n\end{array}$$
显然，通过差分数组 diff[n]，可以求得 A[n] 中的某一具体元素：
$$A[i]=\{\begin{array}{ll}diff[i],& i==0\\ diff[i]+A[i-1],& 0<i<n\end{array}$$

---

应用

1. 数组 A[n] 从下标 j 开始的元素，都增加 v。(即 A[j, j+1, ..., n-1] += v)
   $$diff[j]=diff[j]+v$$
2. 数组 A[n] 在区间 [L, R] 内的元素，都增加 v。(即 A[L, L+1, ..., R] += v)
   $$\{\begin{array}{l}diff[L]=diff[L]+v\\ diff[R+1]=diff[R+1]-v\end{array}$$
3. 数组 A[n] 中的某一元素 A[j] 增加 v。
   $$\{\begin{array}{l}diff[j]=diff[j]+v\\ diff[j+1]=diff[j+1]-v\end{array}$$

---

例题

LeetCode1109. 航班预订统计
暴力解

int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, int n, int* returnSize) {
    int *ret = (int*)calloc(n, sizeof(int));
    memset(ret, 0, n * sizeof(int));

    for (int i = 0; i < bookingsSize; i++)
    {
        for (int j = bookings[i][0] - 1; j < bookings[i][1]; j++)
        {
            ret[j] += bookings[i][2];
        }
    }
    *returnSize = n;

    return ret;
}

差分数组

int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, int n, int* returnSize) {
    int *ret = (int*)calloc(n, sizeof(int)), *diff = (int*)calloc(n, sizeof(int));
    memset(ret, 0, n * sizeof(int));
    memset(diff, 0, n * sizeof(int));
    *returnSize = n;

    for (int i = 0; i < bookingsSize; i++)
    {
        diff[bookings[i][0] - 1] += bookings[i][2];
        if (bookings[i][1] < n)
            diff[bookings[i][1]] -= bookings[i][2];
    }
    ret[0] = diff[0];
    for (int i = 1; i < n; i++)
        ret[i] = diff[i] + ret[i - 1];

    return ret;
}

---

完