feat: add solutions to lc problem: No.1109. Corporate Flight Bookings

Author: yanglbme

solution/1100-1199/1109.Corporate Flight Bookings/README.md

@@ -65,15 +65,39 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def corpFlightBookings(self, bookings: List[List[int]], n: int) -> List[int]:
+        delta = [0] * n
+        for first, last, seats in bookings:
+            delta[first - 1] += seats
+            if last < n:
+                delta[last] -= seats
+        for i in range(n - 1):
+            delta[i + 1] += delta[i]
+        return delta
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] corpFlightBookings(int[][] bookings, int n) {
+        int[] delta = new int[n];
+        for (int[] booking : bookings) {
+            int first = booking[0], last = booking[1], seats = booking[2];
+            delta[first - 1] += seats;
+            if (last < n) {
+                delta[last] -= seats;
+            }
+        }
+        for (int i = 0; i < n - 1; ++i) {
+            delta[i + 1] += delta[i];
+        }
+        return delta;
+    }
+}
 ```
 
 ### **JavaScript**

solution/1100-1199/1109.Corporate Flight Bookings/README_EN.md

@@ -58,13 +58,37 @@ Hence, answer = [10,25]
 ### **Python3**
 
 ```python
-
+class Solution:
+    def corpFlightBookings(self, bookings: List[List[int]], n: int) -> List[int]:
+        delta = [0] * n
+        for first, last, seats in bookings:
+            delta[first - 1] += seats
+            if last < n:
+                delta[last] -= seats
+        for i in range(n - 1):
+            delta[i + 1] += delta[i]
+        return delta
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] corpFlightBookings(int[][] bookings, int n) {
+        int[] delta = new int[n];
+        for (int[] booking : bookings) {
+            int first = booking[0], last = booking[1], seats = booking[2];
+            delta[first - 1] += seats;
+            if (last < n) {
+                delta[last] -= seats;
+            }
+        }
+        for (int i = 0; i < n - 1; ++i) {
+            delta[i + 1] += delta[i];
+        }
+        return delta;
+    }
+}
 ```
 
 ### **JavaScript**

solution/1100-1199/1109.Corporate Flight Bookings/Solution.java

@@ -1,16 +1,16 @@
 class Solution {
     public int[] corpFlightBookings(int[][] bookings, int n) {
-        int[] res = new int[n];
+        int[] delta = new int[n];
         for (int[] booking : bookings) {
-            int b = booking[0] - 1, e = booking[1], k = booking[2];
-            res[b] += k;
-            if (e < n) {
-                res[e] -= k;
+            int first = booking[0], last = booking[1], seats = booking[2];
+            delta[first - 1] += seats;
+            if (last < n) {
+                delta[last] -= seats;
             }
         }
-        for (int i = 1; i < n; ++i) {
-            res[i] += res[i - 1];
+        for (int i = 0; i < n - 1; ++i) {
+            delta[i + 1] += delta[i];
         }
-        return res;
+        return delta;
     }
-}
+}

solution/1100-1199/1109.Corporate Flight Bookings/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def corpFlightBookings(self, bookings: List[List[int]], n: int) -> List[int]:
+        delta = [0] * n
+        for first, last, seats in bookings:
+            delta[first - 1] += seats
+            if last < n:
+                delta[last] -= seats
+        for i in range(n - 1):
+            delta[i + 1] += delta[i]
+        return delta