https://leetcode.cn/problems/linked-list-components/

Author: masx200

6eUYwP/index.ts

@@ -1,3 +1,3 @@
-import pathSum from "../path-sum-iii/index.ts";
-
-export default pathSum;
+import pathSum from "../path-sum-iii/index.ts";
+
+export default pathSum;

README.md

@@ -1316,6 +1316,8 @@ https://leetcode.cn/problems/delete-node-in-a-linked-list/
 
 https://leetcode.cn/problems/4ueAj6/
 
+https://leetcode.cn/problems/linked-list-components/
+
 https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list/
 
 https://leetcode.cn/problems/insert-delete-getrandom-o1/

linked-list-components/index.ts

@@ -0,0 +1,25 @@
+import { ListNode } from "../reverse-linked-list/ListNode.ts";
+
+export default function numComponents(
+    head: ListNode | null,
+    nums: number[],
+): number {
+    const numsSet = new Set<number>();
+    for (const num of nums) {
+        numsSet.add(num);
+    }
+    let inSet = false;
+    let res = 0;
+    while (head) {
+        if (numsSet.has(head.val)) {
+            if (!inSet) {
+                inSet = true;
+                res++;
+            }
+        } else {
+            inSet = false;
+        }
+        head = head.next;
+    }
+    return res;
+}

minimum-swaps-to-make-sequences-increasing/index.ts

@@ -1,19 +1,19 @@
-export default function minSwap(nums1: number[], nums2: number[]): number {
-    const n = nums1.length;
-    let a = 0,
-        b = 1;
-    for (let i = 1; i < n; i++) {
-        const at = a,
-            bt = b;
-        a = b = n;
-        if (nums1[i] > nums1[i - 1] && nums2[i] > nums2[i - 1]) {
-            a = Math.min(a, at);
-            b = Math.min(b, bt + 1);
-        }
-        if (nums1[i] > nums2[i - 1] && nums2[i] > nums1[i - 1]) {
-            a = Math.min(a, bt);
-            b = Math.min(b, at + 1);
-        }
-    }
-    return Math.min(a, b);
-}
+export default function minSwap(nums1: number[], nums2: number[]): number {
+    const n = nums1.length;
+    let a = 0,
+        b = 1;
+    for (let i = 1; i < n; i++) {
+        const at = a,
+            bt = b;
+        a = b = n;
+        if (nums1[i] > nums1[i - 1] && nums2[i] > nums2[i - 1]) {
+            a = Math.min(a, at);
+            b = Math.min(b, bt + 1);
+        }
+        if (nums1[i] > nums2[i - 1] && nums2[i] > nums1[i - 1]) {
+            a = Math.min(a, bt);
+            b = Math.min(b, at + 1);
+        }
+    }
+    return Math.min(a, b);
+}

three-in-one-lcci/test.ts

@@ -1,12 +1,12 @@
-import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
-import TripleInOne from "./index.ts";
-
-Deno.test("three-in-one-lcci", () => {
-    const tio = new TripleInOne(1);
-    tio.push(0, 1);
-    tio.push(0, 2);
-    assertEquals(1, tio.pop(0));
-    assertEquals(-1, tio.pop(0));
-    assertEquals(-1, tio.pop(0));
-    assertEquals(true, tio.isEmpty(0));
-});
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+import TripleInOne from "./index.ts";
+
+Deno.test("three-in-one-lcci", () => {
+    const tio = new TripleInOne(1);
+    tio.push(0, 1);
+    tio.push(0, 2);
+    assertEquals(1, tio.pop(0));
+    assertEquals(-1, tio.pop(0));
+    assertEquals(-1, tio.pop(0));
+    assertEquals(true, tio.isEmpty(0));
+});