Leetcode-1109 航班预订统计 （差分）

 

 

 

 题解

基本差分

class Solution {
public:
    vector<int> corpFlightBookings(vector<vector<int>>& bookings, int n) {
        vector<int> res;
        int cf[20002];
        memset(cf, 0, sizeof(cf));
        int m = bookings.size();
        for (int i=0; i<m; i++){
            int l = bookings[i][0];
            int r = bookings[i][1];
            int t = bookings[i][2];
            cf[l] += t;
            cf[r+1] -= t;
        }
        for (int i=1; i<=n; i++) {
            cf[i] += cf[i-1];
            res.push_back(cf[i]);
        }
        return res;
    }
};