chore: 重构树和链表的类，parse,toArray改为静态方法

Author: Hedwig-Fang

Diff for: common/structures/Node.js

@@ -3,9 +3,10 @@ class Node {
     this.val = val === undefined ? 0 : val;
     this.neighbors = neighbors === undefined ? [] : neighbors;
   }
-  parse(edges) {
+
+  static parse(edges) {
     const nodeMap = new Map();
-  
+
     // 创建节点
     const getNode = (val) => {
       if (!nodeMap.has(val)) {
@@ -14,45 +15,43 @@ class Node {
       }
       return nodeMap.get(val);
     };
-  
+
     // 连接节点
-    edges.forEach((neighbors,index) => {
-      let val = index + 1;
+    edges.forEach((neighbors, index) => {
+      const val = index + 1;
       const currentNode = getNode(val);
-      neighbors.forEach(neighborVal => {
+      neighbors.forEach((neighborVal) => {
         const neighborNode = getNode(neighborVal);
         currentNode.neighbors.push(neighborNode);
       });
     });
-  
+
     return nodeMap.size > 0 ? nodeMap.values().next().value : null;
   }
-  toArray(node) {
+
+  static toArray(node) {
     if (!node) {
       return [];
     }
-  
+
     const visited = new Set();
     const result = [];
-  
+
     const dfs = (currentNode) => {
       if (visited.has(currentNode.val)) {
         return;
       }
-     const {neighbors, val} = currentNode
+      const { neighbors, val } = currentNode;
       visited.add(val);
-      result.push(neighbors.map(res=> res.val));
-  
-      for (const neighbor of currentNode.neighbors) {
+      result.push(neighbors.map(({ val }) => val));
+      currentNode.neighbors.forEach((neighbor) => {
         dfs(neighbor);
-      }
+      });
     };
-  
+
     dfs(node);
-  
+
     return result;
   }
-  
-
 }
-module.exports = Node;
+module.exports = Node;

Diff for: common/structures/TreeNode.js

@@ -1,31 +1,30 @@
 class TreeNode {
   constructor(val, left, right) {
     this.left = null;
-    this.val = (val===undefined ? 0 : val)
-    this.left = (left===undefined ? null : left)
-    this.right = (right===undefined ? null : right)
+    this.val = (val === undefined ? 0 : val);
+    this.left = (left === undefined ? null : left);
+    this.right = (right === undefined ? null : right);
   }
-  parse(arr) {
-    if(arr.length === 0) return null
-    let root = new TreeNode(arr[0])
-    let queue = [root]
-    for(let i = 1; i < arr.length; i += 2)
-    {
-      let node = queue.shift()
-      if(arr[i] !== null)
-      {
-        node.left = new TreeNode(arr[i])
-        queue.push(node.left)
+
+  static parse(arr) {
+    if (arr.length === 0) return null;
+    const root = new TreeNode(arr[0]);
+    const queue = [root];
+    for (let i = 1; i < arr.length; i += 2) {
+      const node = queue.shift();
+      if (arr[i] !== null) {
+        node.left = new TreeNode(arr[i]);
+        queue.push(node.left);
       }
-      if(arr[i+1] !== null)
-      {
-        node.right = new TreeNode(arr[i+1])
-        queue.push(node.right)
+      if (arr[i + 1] !== null) {
+        node.right = new TreeNode(arr[i + 1]);
+        queue.push(node.right);
       }
     }
-    return root
+    return root;
   }
-  toArray(treeNode) {
+
+  static toArray(treeNode) {
     const result = [];
     if (!treeNode) {
       return result;
@@ -51,4 +50,4 @@ class TreeNode {
     return result;
   }
 }
-module.exports = TreeNode
+module.exports = TreeNode;

Diff for: common/utils/parseStructure.js

@@ -7,29 +7,17 @@ const paramMap = {
   cases: {
     ListNode: (_param) => parse(_param),
     'ListNode[]': (param) => param.map((res) => parse(res)),
-    TreeNode: (param) => {
-      const node = new TreeNode(param);
-      return node.parse(param);
-    },
-    Node: (param) => {
-      const node = new Node(param);
-      return node.parse(param);
-    },
+    TreeNode: (param) => TreeNode.parse(param),
+    Node: (param) => Node.parse(param),
     default: (param) => param,
 
   },
   // 返回值map
   return: {
     ListNode: (param) => toArray(param),
     'ListNode[]': (param) => param.map((res) => toArray(res)),
-    TreeNode: (param) => {
-      const node = new TreeNode(param);
-      return node.toArray(param);
-    },
-    Node: (param) => {
-      const node = new Node(param);
-      return node.toArray(param);
-    },
+    TreeNode: (param) => TreeNode.toArray(param),
+    Node: (param) => Node.toArray(param),
     default: (param) => param,
 
   },