feat: update ts solution to lc problem: No.1710

Author: rain84

solution/1700-1799/1710.Maximum Units on a Truck/README.md

@@ -151,18 +151,13 @@ func maximumUnits(boxTypes [][]int, truckSize int) (ans int) {
 #### TypeScript
 
 ```ts
-function maximumUnits(boxTypes: number[][], truckSize: number): number {
-    boxTypes.sort((a, b) => b[1] - a[1]);
-    let sum = 0;
+export function maximumUnits(boxTypes: number[][], truckSize: number): number {
+    boxTypes.sort(([_, a], [__, b]) => b - a);
     let ans = 0;
     for (const [count, size] of boxTypes) {
-        if (sum + count < truckSize) {
-            ans += size * count;
-            sum += count;
-        } else {
-            ans += (truckSize - sum) * size;
-            break;
-        }
+        ans += Math.min(truckSize, count) * size;
+        truckSize -= count;
+        if (truckSize < 0) break;
     }
     return ans;
 }

solution/1700-1799/1710.Maximum Units on a Truck/README_EN.md

@@ -150,18 +150,13 @@ func maximumUnits(boxTypes [][]int, truckSize int) (ans int) {
 #### TypeScript
 
 ```ts
-function maximumUnits(boxTypes: number[][], truckSize: number): number {
-    boxTypes.sort((a, b) => b[1] - a[1]);
-    let sum = 0;
+export function maximumUnits(boxTypes: number[][], truckSize: number): number {
+    boxTypes.sort(([_, a], [__, b]) => b - a);
     let ans = 0;
     for (const [count, size] of boxTypes) {
-        if (sum + count < truckSize) {
-            ans += size * count;
-            sum += count;
-        } else {
-            ans += (truckSize - sum) * size;
-            break;
-        }
+        ans += Math.min(truckSize, count) * size;
+        truckSize -= count;
+        if (truckSize < 0) break;
     }
     return ans;
 }

solution/1700-1799/1710.Maximum Units on a Truck/Solution.ts

@@ -1,15 +1,10 @@
-function maximumUnits(boxTypes: number[][], truckSize: number): number {
-    boxTypes.sort((a, b) => b[1] - a[1]);
-    let sum = 0;
+export function maximumUnits(boxTypes: number[][], truckSize: number): number {
+    boxTypes.sort(([_, a], [__, b]) => b - a);
     let ans = 0;
     for (const [count, size] of boxTypes) {
-        if (sum + count < truckSize) {
-            ans += size * count;
-            sum += count;
-        } else {
-            ans += (truckSize - sum) * size;
-            break;
-        }
+        ans += Math.min(truckSize, count) * size;
+        truckSize -= count;
+        if (truckSize < 0) break;
     }
     return ans;
 }