https://leetcode.cn/problems/distinct-subsequences/

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,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/distinct-subsequences/
+
+https://leetcode.cn/problems/delete-operation-for-two-strings/
+
 https://leetcode.cn/problems/count-pairs-with-xor-in-a-range
 
 https://leetcode.cn/problems/path-with-minimum-effort