feat: update solutions to lc problems

* No.1094.Car Pooling
* No.1109.Corporate Flight Bookings

Author: yanglbme

solution/1000-1099/1094.Car Pooling/README.md

@@ -59,12 +59,7 @@ class Solution:
         for num, start, end in trips:
             delta[start] += num
             delta[end] -= num
-        cur = 0
-        for num in delta:
-            cur += num
-            if cur > capacity:
-                return False
-        return True
+        return all(s <= capacity for s in accumulate(delta))
 ```
 
 ### **Java**
@@ -101,18 +96,17 @@ class Solution {
  * @return {boolean}
  */
 var carPooling = function (trips, capacity) {
-    let delta = new Array();
-    for (let trip of trips) {
-        let [num, start, end] = trip;
-        delta[start] = (delta[start] || 0) + num;
-        delta[end] = (delta[end] || 0) - num;
+    let delta = new Array(1001).fill(0);
+    for (let [num, start, end] of trips) {
+        delta[start] += num;
+        delta[end] -= num;
     }
-    let total = 0;
-    for (let i = 0; i < delta.length; i++) {
-        let cur = delta[i];
-        if (cur == undefined) continue;
-        total += cur;
-        if (total > capacity) return false;
+    let s = 0;
+    for (let num of delta) {
+        s += num;
+        if (s > capacity) {
+            return false;
+        }
     }
     return true;
 };

solution/1000-1099/1094.Car Pooling/README_EN.md

@@ -49,12 +49,7 @@ class Solution:
         for num, start, end in trips:
             delta[start] += num
             delta[end] -= num
-        cur = 0
-        for num in delta:
-            cur += num
-            if cur > capacity:
-                return False
-        return True
+        return all(s <= capacity for s in accumulate(delta))
 ```
 
 ### **Java**
@@ -89,18 +84,17 @@ class Solution {
  * @return {boolean}
  */
 var carPooling = function (trips, capacity) {
-    let delta = new Array();
-    for (let trip of trips) {
-        let [num, start, end] = trip;
-        delta[start] = (delta[start] || 0) + num;
-        delta[end] = (delta[end] || 0) - num;
+    let delta = new Array(1001).fill(0);
+    for (let [num, start, end] of trips) {
+        delta[start] += num;
+        delta[end] -= num;
     }
-    let total = 0;
-    for (let i = 0; i < delta.length; i++) {
-        let cur = delta[i];
-        if (cur == undefined) continue;
-        total += cur;
-        if (total > capacity) return false;
+    let s = 0;
+    for (let num of delta) {
+        s += num;
+        if (s > capacity) {
+            return false;
+        }
     }
     return true;
 };

solution/1000-1099/1094.Car Pooling/Solution.js

@@ -4,18 +4,17 @@
  * @return {boolean}
  */
 var carPooling = function (trips, capacity) {
-    let delta = new Array();
-    for (let trip of trips) {
-        let [num, start, end] = trip;
-        delta[start] = (delta[start] || 0) + num;
-        delta[end] = (delta[end] || 0) - num;
+    let delta = new Array(1001).fill(0);
+    for (let [num, start, end] of trips) {
+        delta[start] += num;
+        delta[end] -= num;
     }
-    let total = 0;
-    for (let i = 0; i < delta.length; i++) {
-        let cur = delta[i];
-        if (cur == undefined) continue;
-        total += cur;
-        if (total > capacity) return false;
+    let s = 0;
+    for (let num of delta) {
+        s += num;
+        if (s > capacity) {
+            return false;
+        }
     }
     return true;
 };

solution/1000-1099/1094.Car Pooling/Solution.py

@@ -1,12 +1,7 @@
-class Solution:
-    def carPooling(self, trips: List[List[int]], capacity: int) -> bool:
-        delta = [0] * 1001
-        for num, start, end in trips:
-            delta[start] += num
-            delta[end] -= num
-        cur = 0
-        for num in delta:
-            cur += num
-            if cur > capacity:
-                return False
-        return True
+class Solution:
+    def carPooling(self, trips: List[List[int]], capacity: int) -> bool:
+        delta = [0] * 1001
+        for num, start, end in trips:
+            delta[start] += num
+            delta[end] -= num
+        return all(s <= capacity for s in accumulate(delta))

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

@@ -88,9 +88,7 @@ class Solution:
             delta[first - 1] += seats
             if last < n:
                 delta[last] -= seats
-        for i in range(n - 1):
-            delta[i + 1] += delta[i]
-        return delta
+        return list(accumulate(delta))
 ```
 
 树状数组：
@@ -214,15 +212,13 @@ class BinaryIndexedTree {
  */
 var corpFlightBookings = function (bookings, n) {
     let delta = new Array(n).fill(0);
-    for (let book of bookings) {
-        let [start, end, num] = book;
-        start -= 1;
-        delta[start] += num;
+    for (let [start, end, num] of bookings) {
+        delta[start - 1] += num;
         if (end != n) {
             delta[end] -= num;
         }
     }
-    for (let i = 1; i < n; i++) {
+    for (let i = 1; i < n; ++i) {
         delta[i] += delta[i - 1];
     }
     return delta;

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

@@ -64,9 +64,7 @@ class Solution:
             delta[first - 1] += seats
             if last < n:
                 delta[last] -= seats
-        for i in range(n - 1):
-            delta[i + 1] += delta[i]
-        return delta
+        return list(accumulate(delta))
 ```
 
 ```python
@@ -180,15 +178,13 @@ class BinaryIndexedTree {
  */
 var corpFlightBookings = function (bookings, n) {
     let delta = new Array(n).fill(0);
-    for (let book of bookings) {
-        let [start, end, num] = book;
-        start -= 1;
-        delta[start] += num;
+    for (let [start, end, num] of bookings) {
+        delta[start - 1] += num;
         if (end != n) {
             delta[end] -= num;
         }
     }
-    for (let i = 1; i < n; i++) {
+    for (let i = 1; i < n; ++i) {
         delta[i] += delta[i - 1];
     }
     return delta;

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

@@ -5,15 +5,13 @@
  */
 var corpFlightBookings = function (bookings, n) {
     let delta = new Array(n).fill(0);
-    for (let book of bookings) {
-        let [start, end, num] = book;
-        start -= 1;
-        delta[start] += num;
+    for (let [start, end, num] of bookings) {
+        delta[start - 1] += num;
         if (end != n) {
             delta[end] -= num;
         }
     }
-    for (let i = 1; i < n; i++) {
+    for (let i = 1; i < n; ++i) {
         delta[i] += delta[i - 1];
     }
     return delta;

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

@@ -1,10 +1,8 @@
-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
+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
+        return list(accumulate(delta))