拼车

class Solution {

    public boolean carPooling(int[][] trips, int capacity) {
        Diff diff = new Diff(1001);
        for (int[] trip: trips) {
            diff.inc(trip[0], trip[1], trip[2]);
        }
        return diff.check(capacity);
    }

}

class Diff {

    private int size;

    private int[] diff;

    public Diff(int size) {
        this.size = size;
        this.diff = new int[size];
    }

    public void inc(int val, int start, int end) {
        diff[start] += val;
        diff[end] -= val;
    }

    public boolean check(int capacity) {
        int sum = diff[0];
        for (int i = 1; i < diff.length; i++) {
            if (sum > capacity) {
                return false;
            }
            sum += diff[i];
        }
        return sum <= capacity;
    }

}

航班预定统计

class Solution {
    public int[] corpFlightBookings(int[][] bookings, int n) {
        Diff diff = new Diff(n);
        for (int[] booking: bookings) {
            diff.inc(booking[2], booking[0] - 1, booking[1] - 1);
        }
        return diff.revert();
    }
}


class Diff {

    private int size;

    private int[] diff;

    public Diff(int size) {
        this.size = size;
        this.diff = new int[size];
    }

    public void inc(int val, int start, int end) {
        diff[start] += val;
        if (end + 1 < diff.length) {
                diff[end + 1] -= val;
            }
    }

    public int[] revert() {
        int[] sum = new int[diff.length];
        sum[0] = diff[0];
        for (int i = 1; i < diff.length; i++) {
            sum[i] = sum[i - 1] + diff[i];
        }
        return sum;
    }
}

区间加法

class Solution {
    public int[] getModifiedArray(int length, int[][] updates) {
        Diff diff = new Diff(length);
        for (int[] update: updates) {
            diff.inc(update[0], update[1], update[2]);
        }
        return diff.revert();
    }
}

class Diff {

    private int size;

    private int[] diff;

    public Diff(int size) {
        this.size = size;
        this.diff = new int[size];
    }

    public void inc(int start, int end, int val) {
        diff[start] += val;
        if (end + 1 < diff.length) {
            diff[end + 1] -= val;
        }
    }

    public int[] revert() {
        int[] sum = new int[diff.length];
        sum[0] = diff[0];
        for (int i = 1; i < diff.length; i++) {
            sum[i] = sum[i - 1] + diff[i];
        }
        return sum;
    }
}