测试ArrayToCircularDoublyTreeList

Author: masx200

4ueAj6/circular-linked-list.ts renamed to 4ueAj6/ArrayToCircularLinkedList.ts

@@ -1,5 +1,6 @@
 import { ListNode } from "../reverse-linked-list/ListNode.ts";
-export function Array_to_circular_linked_list(
+
+export function ArrayToCircularLinkedList(
     array: Array<number>,
 ): ListNode | null {
     if (array.length === 0) {

4ueAj6/test.ts

@@ -1,9 +1,10 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
-import insert from "./index.ts";
+
 import { ListNode as Node } from "../reverse-linked-list/ListNode.ts";
-import { Array_to_circular_linked_list } from "./circular-linked-list.ts";
+import { ArrayToCircularLinkedList } from "./ArrayToCircularLinkedList.ts";
+import insert from "./index.ts";
 
-Deno.test("insert-into-a-sorted-circular-linked-list", () => {
+Deno.test("insert-into-a-sorted-ArrayToCircularLinkedList", () => {
     const head = new Node(1);
     head.next = head;
     const node = new Node(2);
@@ -15,7 +16,7 @@ Deno.test("insert-into-a-sorted-circular-linked-list", () => {
     assertEquals(result?.next?.next?.val, 3);
     assertEquals(result?.next?.next?.next?.val, 1);
 });
-Deno.test("insert-into-a-sorted-circular-linked-list", () => {
+Deno.test("insert-into-a-sorted-ArrayToCircularLinkedList", () => {
     const inputs: Array<[number[], number]> = [
         [[1, 2], 3],
         [[3, 4, 1], 2],
@@ -26,9 +27,9 @@ Deno.test("insert-into-a-sorted-circular-linked-list", () => {
     const outputs = [[1, 2, 3], [3, 4, 1, 2], [1], [1, 0]];
 
     assertEquals(
-        outputs.map(Array_to_circular_linked_list),
+        outputs.map(ArrayToCircularLinkedList),
         inputs.map(([array, insertVal]) => {
-            const head = Array_to_circular_linked_list(array);
+            const head = ArrayToCircularLinkedList(array);
             // console.log(head);
             const result = insert(head, insertVal);
             // console.log(result);

NYBBNL/index.ts

@@ -1,5 +1,6 @@
 import { inorder } from "../binary-tree-inorder-traversal/inorder.ts";
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
 export default function increasingBST(root: TreeNode | null): TreeNode | null {
     if (!root) return null;
     const tree = new TreeNode();

README.md

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import addStrings from "./index.ts";
+
 Deno.test("add-strings", () => {
     const outputs = ["134", "533", "0"];
 

add-strings/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import addToArrayForm from "./index.ts";
+
 Deno.test("add-to-array-form-of-integer", () => {
     const inputs = [
         [[1, 2, 0, 0], 34],

add-to-array-form-of-integer/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import getAncestors from "./index.ts";
+
 Deno.test("all-ancestors-of-a-node-in-a-directed-acyclic-graph", () => {
     const outputs = [
         [[], [], [], [0, 1], [0, 2], [0, 1, 3], [0, 1, 2, 3, 4], [0, 1, 2, 3]],

all-ancestors-of-a-node-in-a-directed-acyclic-graph/test.ts

@@ -1,6 +1,7 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 import { inorder } from "./inorder.ts";
 import { merge_sort } from "./merge_sort.ts";
+
 export default function getAllElements(
     root1: TreeNode | null,
     root2: TreeNode | null,

all-elements-in-two-binary-search-trees/index.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import getAllElements from "./index.ts";
+
 Deno.test("all-elements-in-two-binary-search-trees", () => {
     const inputs = [
         [

all-elements-in-two-binary-search-trees/test.ts

@@ -1,5 +1,6 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
 import { runScript } from "leetcode-class";
+
 import AllOne from "./index.ts";
 
 Deno.test("all-oone-data-structure", () => {