https://leetcode.cn/problems/print-immutable-linked-list-in-reverse/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/print-immutable-linked-list-in-reverse/
+
 https://leetcode.cn/problems/plus-one-linked-list/
 
 https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/

print-immutable-linked-list-in-reverse/ImmutableListNode.ts

@@ -0,0 +1,19 @@
+export class ImmutableListNode {
+    #print;
+    #index = 0;
+    #array: number[];
+    constructor(array: Array<number>, print: (value: number) => void) {
+        if (array.length === 0) throw Error("input empty array");
+        this.#print = print;
+        this.#array = array;
+    }
+    printValue() {
+        this.#print(this.#array[this.#index]);
+    }
+    getNext(): ImmutableListNode | null {
+        if (this.#index+1 >= this.#array.length) return null;
+        const next = new ImmutableListNode(this.#array, this.#print);
+        next.#index = this.#index + 1;
+        return next;
+    }
+}

print-immutable-linked-list-in-reverse/index.ts

@@ -0,0 +1,10 @@
+import { ImmutableListNode } from "./ImmutableListNode.ts";
+
+export default function printLinkedListInReverse(
+    head: ImmutableListNode | null
+) {
+    if (head !== null) {
+        printLinkedListInReverse(head.getNext());
+        head.printValue();
+    }
+}

print-immutable-linked-list-in-reverse/test.ts

@@ -0,0 +1,27 @@
+import { ImmutableListNode } from "./ImmutableListNode.ts";
+import printLinkedListInReverse from "./index.ts";
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
+Deno.test("print-immutable-linked-list-in-reverse", () => {
+    const cases = [
+        [
+            [1, 2, 3, 4],
+            [4, 3, 2, 1],
+        ],
+        [
+            [0, -4, -1, 3, -5],
+            [-5, 3, -1, -4, 0],
+        ],
+        [
+            [-2, 0, 6, 4, 4, -6],
+            [-6, 4, 4, 6, 0, -2],
+        ],
+    ];
+    cases.forEach(([input, output]) => {
+        const result: number[] = [];
+        const node = new ImmutableListNode(input, (v) => result.push(v));
+        printLinkedListInReverse(node);
+
+        assertEquals(output, result);
+    });
+});