Add solution #1109

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,138 LeetCode solutions in JavaScript
+# 1,139 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -882,6 +882,7 @@
 1105|[Filling Bookcase Shelves](./solutions/1105-filling-bookcase-shelves.js)|Medium|
 1106|[Parsing A Boolean Expression](./solutions/1106-parsing-a-boolean-expression.js)|Hard|
 1108|[Defanging an IP Address](./solutions/1108-defanging-an-ip-address.js)|Easy|
+1109|[Corporate Flight Bookings](./solutions/1109-corporate-flight-bookings.js)|Medium|
 1122|[Relative Sort Array](./solutions/1122-relative-sort-array.js)|Easy|
 1123|[Lowest Common Ancestor of Deepest Leaves](./solutions/1123-lowest-common-ancestor-of-deepest-leaves.js)|Medium|
 1137|[N-th Tribonacci Number](./solutions/1137-n-th-tribonacci-number.js)|Easy|

solutions/1109-corporate-flight-bookings.js

@@ -0,0 +1,34 @@
+/**
+ * 1109. Corporate Flight Bookings
+ * https://leetcode.com/problems/corporate-flight-bookings/
+ * Difficulty: Medium
+ *
+ * There are n flights that are labeled from 1 to n.
+ *
+ * You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi]
+ * represents a booking for flights firsti through lasti (inclusive) with seatsi seats reserved
+ * for each flight in the range.
+ *
+ * Return an array answer of length n, where answer[i] is the total number of seats reserved for
+ * flight i.
+ */
+
+/**
+ * @param {number[][]} bookings
+ * @param {number} n
+ * @return {number[]}
+ */
+var corpFlightBookings = function(bookings, n) {
+  const result = new Array(n).fill(0);
+
+  for (const [start, end, count] of bookings) {
+    result[start - 1] += count;
+    if (end < n) result[end] -= count;
+  }
+
+  for (let i = 1; i < n; i++) {
+    result[i] += result[i - 1];
+  }
+
+  return result;
+};