https://leetcode-cn.com/problems/evaluate-the-bracket-pairs-of-a-string/

Author: masx200

2vYnGI/index.ts

@@ -1,7 +1,7 @@
 export default function breakfastNumber(
     staple: number[],
     drinks: number[],
-    x: number,
+    x: number
 ): number {
     staple.sort((a, b) => a - b);
     drinks.sort((a, b) => a - b);

3sum-closest/index.ts

@@ -1,6 +1,6 @@
 export default function threeSumClosest(
     nums: number[],
-    target: number,
+    target: number
 ): number {
     const N = nums.length;
     let res = Number.MAX_SAFE_INTEGER;

4sum/index.ts

@@ -12,8 +12,8 @@ function fourSum(nums: number[], target: number): number[][] {
             let left: number = j + 1;
             let right: number = nums.length - 1;
             while (left < right) {
-                const res: number = nums[i] + nums[j] + nums[left] +
-                    nums[right];
+                const res: number =
+                    nums[i] + nums[j] + nums[left] + nums[right];
                 if (res > target) {
                     right--;
                 } else if (res < target) {

4ueAj6/index.ts

@@ -2,7 +2,7 @@ import { ListNode as Node } from "../reverse-linked-list/ListNode.ts";
 
 export default function insert(
     head: Node | null,
-    insertVal: number,
+    insertVal: number
 ): Node | null {
     if (!head) {
         const node = new Node(insertVal);

FJxjiD/index.ts

@@ -16,16 +16,16 @@ export default function chickenCoolRun(paths: number[][]): number {
             temp[1] = Math.min(
                 temp[1],
                 temp[0] < Infinity ? temp[0] + 1 : Infinity,
-                temp[2] < Infinity ? temp[2] + 1 : Infinity,
+                temp[2] < Infinity ? temp[2] + 1 : Infinity
             );
 
             temp[0] = Math.min(
                 temp[0],
-                paths[0][j] === 0 ? temp[1] + 1 : Infinity,
+                paths[0][j] === 0 ? temp[1] + 1 : Infinity
             );
             temp[2] = Math.min(
                 temp[2],
-                paths[2][j] === 0 ? temp[1] + 1 : Infinity,
+                paths[2][j] === 0 ? temp[1] + 1 : Infinity
             );
         }
 

Jf1JuT/index.ts

@@ -61,7 +61,7 @@ function createEdgesAndIndegrees(words: string[]): {
 function topologicalsort(
     edges: Map<string, Set<string>>,
     indegrees: Map<string, number>,
-    chars: Set<string>,
+    chars: Set<string>
 ): string[] {
     const order: string[] = [];
 

KnLfVT/index.ts

@@ -1,15 +1,15 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 
 export default function expandBinaryTree(
-    root: TreeNode | null,
+    root: TreeNode | null
 ): TreeNode | null {
     return root
         ? new TreeNode(
-            root.val,
-            root.left ? new TreeNode(-1, expandBinaryTree(root.left)) : null,
-            root.right
-                ? new TreeNode(-1, null, expandBinaryTree(root.right))
-                : null,
-        )
+              root.val,
+              root.left ? new TreeNode(-1, expandBinaryTree(root.left)) : null,
+              root.right
+                  ? new TreeNode(-1, null, expandBinaryTree(root.right))
+                  : null
+          )
         : null;
 }

NyZD2B/index.ts

@@ -15,7 +15,7 @@ class VendingMachine {
         number: number,
         item: string,
         price: number,
-        duration: number,
+        duration: number
     ): void {
         const good = this.#item2good.get(item) ?? [
             new AvlTree((a, b) =>
@@ -71,7 +71,7 @@ class VendingMachine {
                     cost += value.price * diff;
                 }
             },
-            signal,
+            signal
         );
 
         toBeRemoved.forEach((n) => tree.remove(n));

QO5KpG/index.ts

@@ -4,7 +4,7 @@ import { lowerBound } from "../number-of-pairs-satisfying-inequality/lowerBound.
 
 export default function getNumber(
     root: TreeNode | null,
-    ops: number[][],
+    ops: number[][]
 ): number {
     const sorted = inorderTraversal(root);
     let ans = 0;

README.md

@@ -49,6 +49,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode-cn.com/problems/evaluate-the-bracket-pairs-of-a-string/
+
 https://leetcode.cn/problems/find-the-middle-index-in-array/
 
 https://leetcode.cn/problems/find-pivot-index/

U7WvvU/index.ts

@@ -29,7 +29,7 @@ export default function closeLampInTree(root: TreeNode | null): number {
                 open + 1,
                 close + 1,
                 self + 3,
-                notSelf + 1,
+                notSelf + 1
             );
         }
 
@@ -41,15 +41,15 @@ export default function closeLampInTree(root: TreeNode | null): number {
                 open + 1,
                 close + 1,
                 self + 1,
-                notSelf + 3,
+                notSelf + 3
             );
         } else {
             allClose = Math.min(
                 allClose,
                 open + 2,
                 close,
                 self + 2,
-                notSelf + 2,
+                notSelf + 2
             );
         }
 
@@ -60,7 +60,7 @@ export default function closeLampInTree(root: TreeNode | null): number {
                 open + 2,
                 close,
                 self + 2,
-                notSelf + 2,
+                notSelf + 2
             );
         } else {
             // 关着
@@ -69,7 +69,7 @@ export default function closeLampInTree(root: TreeNode | null): number {
                 open + 1,
                 close + 1,
                 self + 1,
-                notSelf + 3,
+                notSelf + 3
             );
         }
 
@@ -81,15 +81,15 @@ export default function closeLampInTree(root: TreeNode | null): number {
                 open + 1,
                 close + 1,
                 self + 3,
-                notSelf + 1,
+                notSelf + 1
             );
         } else {
             justNotSelf = Math.min(
                 justNotSelf,
                 open,
                 close + 2,
                 self + 2,
-                notSelf + 2,
+                notSelf + 2
             );
         }
 

ZbAuEH/index.ts

@@ -23,7 +23,7 @@ function getMaximumNumber(moles: number[][]): number {
         for (let cnt = 0, j = i - 1; cnt < 10 && j >= 0; j--, cnt++) {
             if (
                 Math.abs(x - moles[j][1]) + Math.abs(y - moles[j][2]) <=
-                    t - moles[j][0]
+                t - moles[j][0]
             ) {
                 dp[i][1] = Math.max(dp[i][1], dp[j][1] + 1);
             }

add-binary/index.ts

@@ -3,7 +3,8 @@ export default function addBinary(num1: string, num2: string): string {
     let carry = 0;
     for (let i = 0; i < Math.max(num2.length, num1.length); i++) {
         // console.log(i, num1[i], num2[i], carry);
-        const r = carry +
+        const r =
+            carry +
             Number(getIntegerReverse(num1, i)) +
             Number(getIntegerReverse(num2, i));
         result.push(r % 2);

add-one-row-to-tree/index.ts

@@ -3,7 +3,7 @@ import { TreeNode } from "../mod.ts";
 export default function addOneRow(
     root: TreeNode | null,
     val: number,
-    depth: number,
+    depth: number
 ): TreeNode | null {
     if (!root || !depth) return null;
 
@@ -13,13 +13,13 @@ export default function addOneRow(
         return new TreeNode(
             root.val,
             new TreeNode(val, root.left),
-            new TreeNode(val, null, root.right),
+            new TreeNode(val, null, root.right)
         );
     }
 
     return new TreeNode(
         root.val,
         addOneRow(root.left, val, depth - 1),
-        addOneRow(root.right, val, depth - 1),
+        addOneRow(root.right, val, depth - 1)
     );
 }

add-two-numbers-ii/index.ts

@@ -2,7 +2,7 @@ import { ListNode } from "../mod.ts";
 
 export default function addTwoNumbers(
     l1: ListNode | null,
-    l2: ListNode | null,
+    l2: ListNode | null
 ): ListNode | null {
     if (!l1) {
         return l2;

add-two-polynomials-represented-as-linked-lists/index.ts

@@ -2,7 +2,7 @@ import { PolyNode } from "./PolyNode.ts";
 
 export default function addPoly(
     poly1: PolyNode | null,
-    poly2: PolyNode | null,
+    poly2: PolyNode | null
 ): PolyNode | null {
     const dummy = new PolyNode();
     let node = dummy;

adding-two-negabinary-numbers/index.ts

@@ -1,6 +1,6 @@
 export default function addNegabinary(
     arr1: number[],
-    arr2: number[],
+    arr2: number[]
 ): number[] {
     const len = Math.max(arr1.length, arr2.length);
     arr1 = arr1.reverse();

advantage-shuffle/index.ts

@@ -1,6 +1,6 @@
 export default function advantageCount(
     nums1: number[],
-    nums2: number[],
+    nums2: number[]
 ): number[] {
     const n = nums1.length;
     const idx1: number[] = new Array(n).fill(0);

alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/index.ts

@@ -1,6 +1,6 @@
 export default function alertNames(
     keyName: string[],
-    keyTime: string[],
+    keyTime: string[]
 ): string[] {
     const map = new Map<string, number[]>();
 
@@ -21,7 +21,7 @@ export default function alertNames(
                 v.length >= 3 &&
                 v
                     .sort((a, b) => a - b)
-                    .some((n, i, a) => i + 2 < a.length && 60 >= a[i + 2] - n),
+                    .some((n, i, a) => i + 2 < a.length && 60 >= a[i + 2] - n)
         )
         .map((a) => a[0])
         .sort();

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

@@ -4,7 +4,7 @@ import { merge_sort } from "./merge_sort.ts";
 
 export default function getAllElements(
     root1: TreeNode | null,
-    root2: TreeNode | null,
+    root2: TreeNode | null
 ): number[] {
     const nums1: number[] = [];
     const nums2: number[] = [];

all-paths-from-source-to-target/index.ts

@@ -7,7 +7,7 @@ function dfs(
     graph: number[][],
     res: number[][],
     index: number,
-    path: number[],
+    path: number[]
 ) {
     if (index === graph.length - 1) {
         res.push(Array.from(path));

apply-discount-to-prices/index.ts

@@ -1,6 +1,6 @@
 export default function discountPrices(
     sentence: string,
-    discount: number,
+    discount: number
 ): string {
     return sentence
         .split(" ")

armstrong-number/index.ts

@@ -2,7 +2,7 @@ export default function isArmstrong(n: number) {
     return (
         [...n.toString()].reduce(
             (p, v, _i, a) => p + Math.pow(Number(v), a.length),
-            0,
+            0
         ) === n
     );
 }

average-of-levels-in-binary-tree/index.ts

@@ -21,6 +21,6 @@ function level(nodes: TreeNode[], output: (r: number) => void) {
         nodes
             .map((n) => [n.left, n.right].filter(Boolean) as TreeNode[])
             .flat(),
-        output,
+        output
     );
 }

basic-calculator-iv/index.ts

@@ -4,7 +4,7 @@ import { tokenize } from "./tokenize.ts";
 export default function basicCalculatorIV(
     expression: string,
     evalvars: string[],
-    evalints: number[],
+    evalints: number[]
 ): string[] {
     const tokens = tokenize(expression, evalvars, evalints);
     return parse(tokens).toList();

beautiful-arrangement/index.ts

@@ -2,20 +2,5 @@ export default function countArrangement(n: number): number {
     return cache[n] ?? 0;
 }
 const cache = [
-    0,
-    1,
-    2,
-    3,
-    8,
-    10,
-    36,
-    41,
-    132,
-    250,
-    700,
-    750,
-    4010,
-    4237,
-    10680,
-    24679,
+    0, 1, 2, 3, 8, 10, 36, 41, 132, 250, 700, 750, 4010, 4237, 10680, 24679,
 ];

best-time-to-buy-and-sell-stock-iv/index.ts

@@ -3,9 +3,8 @@ function maxProfit(k: number, prices: number[]): number {
         return 0;
     }
 
-    const dp: number[][] = Array.from(
-        Array(prices.length),
-        () => Array(2 * k + 1).fill(0),
+    const dp: number[][] = Array.from(Array(prices.length), () =>
+        Array(2 * k + 1).fill(0)
     );
 
     for (let j = 1; j < 2 * k; j += 2) {
@@ -17,7 +16,7 @@ function maxProfit(k: number, prices: number[]): number {
             dp[i][j + 1] = Math.max(dp[i - 1][j + 1], dp[i - 1][j] - prices[i]);
             dp[i][j + 2] = Math.max(
                 dp[i - 1][j + 2],
-                dp[i - 1][j + 1] + prices[i],
+                dp[i - 1][j + 1] + prices[i]
             );
         }
     }

binary-tree-upside-down/index.ts

@@ -1,7 +1,7 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 
 export default function upsideDownBinaryTree(
-    root: TreeNode | null,
+    root: TreeNode | null
 ): TreeNode | null {
     if (root == null) {
         return root;

boats-to-save-people/index.ts

@@ -1,6 +1,6 @@
 export default function numRescueBoats(
     people: number[],
-    limit: number,
+    limit: number
 ): number {
     let l = 0,
         r = people.length - 1;