格式化

Author: masx200

color-fill-lcci/index.ts

@@ -1 +1 @@
-export {default}from"../flood-fill/index.ts"
+export { default } from "../flood-fill/index.ts";

longest-univalue-path/index.ts

@@ -1,28 +1,25 @@
-import {TreeNode}from"../mod.ts"
+import { TreeNode } from "../mod.ts";
 export default function longestUnivaluePath(root: TreeNode | null): number {
-
-if(!root)return 0
-
-
+    if (!root) return 0;
 
     let res = 0;
-    
-    dfs(root,s=>res=Math.max(res,s));
+
+    dfs(root, (s) => res = Math.max(res, s));
     return res;
 }
-function dfs(root: TreeNode | null,out:(s:number)=>void) {
-        if (!root) {
-            return 0;
-        }
-        const left = dfs(root.left,out)
-        const  right = dfs(root.right,out);
-        let left1 = 0, right1 = 0;
-        if (root.left && root.left.val === root.val) {
-            left1 = left + 1;
-        }
-        if (root.right && root.right.val === root.val) {
-            right1 = right + 1;
-        }
-        out( left1 + right1);
-        return Math.max(left1, right1);
+function dfs(root: TreeNode | null, out: (s: number) => void) {
+    if (!root) {
+        return 0;
     }
+    const left = dfs(root.left, out);
+    const right = dfs(root.right, out);
+    let left1 = 0, right1 = 0;
+    if (root.left && root.left.val === root.val) {
+        left1 = left + 1;
+    }
+    if (root.right && root.right.val === root.val) {
+        right1 = right + 1;
+    }
+    out(left1 + right1);
+    return Math.max(left1, right1);
+}

power-set-lcci/index.ts

@@ -2,7 +2,7 @@ export default function subsets(nums: number[]): number[][] {
     const ans: number[][] = [];
 
     for (let i = 0; i < 2 ** nums.length; i++) {
-        const temp : number[]= [];
+        const temp: number[] = [];
         for (
             const [j, v] of (
                 Array.from(i.toString(2)).reverse().entries()