package leetcode;

import java.util.Arrays;

/**
 * https://leetcode.com/problems/corporate-flight-bookings/
 */
public class Problem1109 {
    public int[] corpFlightBookings(int[][] bookings, int n) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem1109 prob = new Problem1109();
        System.out.println(Arrays.toString(prob.corpFlightBookings(new int[][]{
            {1, 2, 10}, {2, 3, 20}, {2, 5, 25}
        }, 5))); // [10,55,45,25,25]
    }
}

@@ -208,15 +208,205 @@
     
-// TODO
+int%5B%5D answer = new int%5Bn%5D;%0A        for (int%5B%5D booking : bookings) %7B%0A            for (int i = booking%5B0%5D; i %3C= booking%5B1%5D; i++) %7B%0A                answer%5Bi - 1%5D += booking%5B2%5D;%0A            %7D%0A        %7D
 %0A   
@@ -421,12 +421,14 @@
 urn 
-null
+answer
 ;%0A  

Update problem 1109