测试

Author: masx200

maximum-ascending-subarray-sum/test.ts

@@ -0,0 +1,12 @@
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+import maxAscendingSum from "./index.ts";
+Deno.test("maximum-ascending-subarray-sum", () => {
+    assertEquals(
+        [
+            [10, 20, 30, 5, 10, 50],
+            [10, 20, 30, 40, 50],
+            [12, 17, 15, 13, 10, 11, 12],
+        ].map(maxAscendingSum),
+        [65, 150, 33],
+    );
+});

number-of-pairs-satisfying-inequality/index.ts

@@ -1,28 +1,28 @@
-import { BinaryIndexTree } from "../rank-from-stream-lcci/BinaryIndexTree.ts";
-export default function numberOfPairs(
-    nums1: number[],
-    nums2: number[],
-    diff: number
-): number {
-    for (const [i, x] of nums2.entries()) {
-        nums1[i] -= x;
-    }
-    const b = Array.from(nums1).sort((a, b) => a - b);
-    let ans = 0;
-    const t = new BinaryIndexTree(nums1.length);
-    for (const x of nums1) {
-        ans += t.query(lowerBound(b, x + diff + 1));
-        t.update(lowerBound(b, x) + 1, +1);
-    }
-    return ans;
-}
-export function lowerBound(a: number[], x: number) {
-    let left = 0,
-        right = a.length;
-    while (left < right) {
-        const mid = Math.floor(left + (right - left) / 2);
-        if (a[mid] < x) left = mid + 1;
-        else right = mid;
-    }
-    return left;
-}
+import { BinaryIndexTree } from "../rank-from-stream-lcci/BinaryIndexTree.ts";
+export default function numberOfPairs(
+    nums1: number[],
+    nums2: number[],
+    diff: number,
+): number {
+    for (const [i, x] of nums2.entries()) {
+        nums1[i] -= x;
+    }
+    const b = Array.from(nums1).sort((a, b) => a - b);
+    let ans = 0;
+    const t = new BinaryIndexTree(nums1.length);
+    for (const x of nums1) {
+        ans += t.query(lowerBound(b, x + diff + 1));
+        t.update(lowerBound(b, x) + 1, +1);
+    }
+    return ans;
+}
+export function lowerBound(a: number[], x: number) {
+    let left = 0,
+        right = a.length;
+    while (left < right) {
+        const mid = Math.floor(left + (right - left) / 2);
+        if (a[mid] < x) left = mid + 1;
+        else right = mid;
+    }
+    return left;
+}

number-of-pairs-satisfying-inequality/test.ts

@@ -0,0 +1,12 @@
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+import numberOfPairs from "./index.ts";
+Deno.test("number-of-pairs-satisfying-inequality", () => {
+    assertEquals(
+        [
+            [[3, 2, 5], [2, 2, 1], 1],
+            [[3, -1], [-2, 2], -1],
+            //@ts-ignore
+        ].map((a) => numberOfPairs(...a)),
+        [3, 0],
+    );
+});

rank-from-stream-lcci/BinaryIndexTree.ts

@@ -15,7 +15,7 @@ export class BinaryIndexTree<T = number> {
             operation: (a: number, b: number) => a + b,
             //@ts-ignore
             defaultValue: 0,
-        }
+        },
     ) {
         const { defaultValue, operation } = options;
         this.#tree = Array(size + 1).fill(defaultValue);