https://leetcode.cn/problems/global-and-local-inversions

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/global-and-local-inversions
+
 https://leetcode.cn/problems/maximum-units-on-a-truck
 
 https://leetcode.cn/problems/split-array-with-same-average

global-and-local-inversions/index.ts

@@ -0,0 +1,4 @@
+function isIdealPermutation(nums: number[]): boolean {
+    return nums.every((v, i) => Math.abs(v - i) <= 1);
+}
+export default isIdealPermutation;

maximum-units-on-a-truck/index.ts

@@ -1,19 +1,19 @@
-export default function maximumUnits(
-    boxTypes: number[][],
-    truckSize: number
-): number {
-    boxTypes.sort((a, b) => b[1] - a[1]);
-    let res = 0;
-    for (const boxType of boxTypes) {
-        const numberOfBoxes = boxType[0];
-        const numberOfUnitsPerBox = boxType[1];
-        if (numberOfBoxes < truckSize) {
-            res += numberOfBoxes * numberOfUnitsPerBox;
-            truckSize -= numberOfBoxes;
-        } else {
-            res += truckSize * numberOfUnitsPerBox;
-            break;
-        }
-    }
-    return res;
-}
+export default function maximumUnits(
+    boxTypes: number[][],
+    truckSize: number,
+): number {
+    boxTypes.sort((a, b) => b[1] - a[1]);
+    let res = 0;
+    for (const boxType of boxTypes) {
+        const numberOfBoxes = boxType[0];
+        const numberOfUnitsPerBox = boxType[1];
+        if (numberOfBoxes < truckSize) {
+            res += numberOfBoxes * numberOfUnitsPerBox;
+            truckSize -= numberOfBoxes;
+        } else {
+            res += truckSize * numberOfUnitsPerBox;
+            break;
+        }
+    }
+    return res;
+}