格式化

Author: masx200

QO5KpG/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
-import getNumber from "./index.ts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
+import getNumber from "./index.ts";
+
 Deno.test("QO5KpG", () => {
     assertEquals(
         2,

VLNEbD/test.ts

@@ -1,7 +1,9 @@
 import { assertEquals } from "asserts";
+
 import { ArrayToListNode } from "../reverse-linked-list/ArrayToListNode.ts";
-import reContruct from "./index.ts";
 import { ListNodeToArray } from "../reverse-linked-list/ListNodeToArray.ts";
+import reContruct from "./index.ts";
+
 Deno.test("reContruct", () => {
     assertEquals(
         [[1, 4, 3, 6], [5, 7, 9, 9, 1], [2, 4], []]

binary-tree-upside-down/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import upsideDownBinaryTree from "./index.ts";
+
 Deno.test("binary-tree-upside-down", () => {
     assertEquals(
         upsideDownBinaryTree(TreeNodeLeetCodeFromJSON([1, 2, 3, 4, 5])),

boundary-of-binary-tree/index.ts

@@ -1,4 +1,5 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
 export default function boundaryOfBinaryTree(root: TreeNode): number[] {
     const ans: number[] = [];
     if (!root) return [];

boundary-of-binary-tree/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
+
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 import boundaryOfBinaryTree from "./index.ts";
+
 Deno.test("boundary-of-binary-tree", () => {
     assertEquals(
         boundaryOfBinaryTree({

bulls-and-cows/index.ts

@@ -1,4 +1,5 @@
 import { counter } from "../substring-with-concatenation-of-all-words/counter.ts";
+
 function getHint(secret: string, guess: string): string {
     const bulls = [...secret].filter((v, i) => guess[i] === v).length;
 

check.ts

@@ -1,8 +1,12 @@
-import { WalkEntry } from "./deps.ts";
-
-import { parse, walk } from "./deps.ts";
+import {
+    AsyncCurrentLimiter,
+    AsyncLimiterClass,
+    parse,
+    walk,
+    WalkEntry,
+} from "./deps.ts";
 import { split_by_count } from "./utils/split_by_count.ts";
-import { AsyncCurrentLimiter, AsyncLimiterClass } from "./deps.ts";
+
 function searchFilesNames({
     skip,
 }: {

checking-existence-of-edge-length-limited-paths-ii/test.ts

@@ -1,6 +1,7 @@
-import DistanceLimitedPathsExist from "./index.ts";
 import { assertEquals } from "asserts";
 
+import DistanceLimitedPathsExist from "./index.ts";
+
 Deno.test("1724.Checking-Existence-of-Edge-Length-Limited-Paths-II", () => {
     const res: any[] = [];
     const distanceLimitedPathsExist = new DistanceLimitedPathsExist(6, [

checking-existence-of-edge-length-limited-paths/index.ts

@@ -1,4 +1,5 @@
 import { UnionFind } from "../largest-component-size-by-common-factor/UnionFind.ts";
+
 function distanceLimitedPathsExist(
     _n: number,
     edgeList: number[][],

closest-nodes-queries-in-a-binary-search-tree/index.ts

@@ -1,5 +1,5 @@
-import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 import inorderTraversal from "../binary-tree-inorder-traversal/index.ts";
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 import { lowerBound } from "../maximum-profit-in-job-scheduling/lowerBound.ts";
 import { upperBound } from "../maximum-profit-in-job-scheduling/upperBound.ts";
 

closest-nodes-queries-in-a-binary-search-tree/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import closestNodes from "./index.ts";
+
 Deno.test("closest-nodes-queries-in-a-binary-search-tree", () => {
     const root = [
             6,

concatenated-words/index.ts

@@ -1,4 +1,6 @@
-import { PrefixTreeInsert } from "../design-add-and-search-words-data-structure/PrefixTreeInsert.ts";
+import {
+    PrefixTreeInsert,
+} from "../design-add-and-search-words-data-structure/PrefixTreeInsert.ts";
 import { PrefixTree } from "../implement-trie-prefix-tree/PrefixTree.ts";
 
 export default function findAllConcatenatedWordsInADict(

deno.lock

@@ -23,7 +23,7 @@ export {
     AvlTree,
     BinarySearchTree,
     BinarySearchTreeNode,
-} from "https://esm.sh/@datastructures-js/binary-search-tree@undefined/";
+} from "https://esm.sh/@datastructures-js/binary-search-tree@5.2.0";
 export { default as groupBy } from "https://cdn.skypack.dev/lodash@4.17.21/groupBy?dts";
 export { default as sum } from "https://cdn.skypack.dev/lodash@4.17.21/sum?dts";
 export {
@@ -32,10 +32,12 @@ export {
 } from "https://esm.sh/@masx200/leetcode-class@1.2.5";
 
 export type { WalkEntry } from "https://deno.land/std@0.170.0/fs/_util.ts";
+
 import AsyncLimiterClass, {
     AsyncCurrentLimiter,
 } from "https://cdn.skypack.dev/@masx200/async-task-current-limiter@2.1.0?dts";
+import memoize from "https://cdn.skypack.dev/lodash@4.17.21/memoize?dts";
+
 export { AsyncLimiterClass };
 export type { AsyncCurrentLimiter };
-import memoize from "https://cdn.skypack.dev/lodash@4.17.21/memoize?dts";
 export { memoize };

deps.ts

@@ -1,4 +1,6 @@
-import { MapWithExpires } from "https://deno.land/x/masx200_deno_caddy_cluster_reverse_proxy@3.0.3/MapWithExpires.ts";
+import {
+    MapWithExpires,
+} from "https://deno.land/x/masx200_deno_caddy_cluster_reverse_proxy@3.0.3/MapWithExpires.ts";
 
 class AuthenticationManager {
     #map = new MapWithExpires<string, { expires: number }>();

design-authentication-manager/index.ts

@@ -1,5 +1,7 @@
-import StringIterator from "./index.ts";
 import { assertEquals } from "asserts";
+
+import StringIterator from "./index.ts";
+
 Deno.test("design-compressed-string-iterator", () => {
     const iterator = new StringIterator("L1e2t1C1o1d1e1");
     const res: any[] = [];

design-compressed-string-iterator/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
 import { runScript } from "leetcode-class";
+
 import FileSystem from "./index.ts";
+
 Deno.test("design-file-system", () => {
     assertEquals(
         runScript(

design-file-system/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
 import { runScript } from "leetcode-class";
+
 import FileSystem from "./index.ts";
+
 Deno.test("design-in-memory-file-system", () => {
     assertEquals(
         runScript(

design-in-memory-file-system/test.ts

@@ -1,5 +1,8 @@
-import { BinarySearchTreeNode } from "https://esm.sh/v92/@datastructures-js/binary-search-tree@5.0.2/src/binarySearchTreeNode.js";
 import { BinarySearchTree } from "https://esm.sh/@datastructures-js/binary-search-tree@5.2.0/";
+import {
+    BinarySearchTreeNode,
+} from "https://esm.sh/v92/@datastructures-js/binary-search-tree@5.0.2/src/binarySearchTreeNode.js";
+
 import { HashMap } from "./HashMap.ts";
 
 export default class MovieRentingSystem {

design-movie-rental-system/index.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
 import { runScript } from "leetcode-class";
+
 import MovieRentingSystem from "./index.ts";
+
 Deno.test("design-movie-rental-system", () => {
     assertEquals(
         runScript([

design-movie-rental-system/test.ts

@@ -1,7 +1,7 @@
 import { assertEquals } from "asserts";
+import { runScript } from "leetcode-class";
 
 import Skiplist from "./index.ts";
-import { runScript } from "leetcode-class";
 
 Deno.test("design-skiplist", () => {
     const skiplist: Skiplist = Skiplist();

design-skiplist/test.ts

@@ -1,4 +1,5 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
 function maxValue(root: TreeNode | null, k: number): number {
     return Math.max(...dfs(root, k));
 }

er-cha-shu-ran-se-UGC/index.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
-import maxValue from "./index.ts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
+import maxValue from "./index.ts";
+
 Deno.test("er-cha-shu-ran-se-UGC", () => {
     assertEquals(12, maxValue(TreeNodeLeetCodeFromJSON([5, 2, 3, 4]), 2));
     assertEquals(

er-cha-shu-ran-se-UGC/test.ts

@@ -1,7 +1,9 @@
 import { assertEquals } from "asserts";
 import { runScript } from "leetcode-class";
-import Fancy from "./index.ts";
+
 import Fancy2 from "./Fancy.ts";
+import Fancy from "./index.ts";
+
 Deno.test("fancy-sequence", () => {
     const fcs = [Fancy, Fancy2];
 

fancy-sequence/test.ts

@@ -1,4 +1,5 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
 export default function findLeaves(root: TreeNode | null): number[][] {
     if (!root) {
         return [];

find-leaves-of-binary-tree/index.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import findLeaves from "./index.ts";
+
 Deno.test("find-leaves-of-binary-tree", () => {
     assertEquals(
         [[4, 5, 3], [2], [1]],

find-leaves-of-binary-tree/test.ts

@@ -1,6 +1,8 @@
-import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
 import { default as groupBy } from "https://cdn.skypack.dev/lodash@4.17.21/groupBy?dts";
+
 import inorderTraversal from "../binary-tree-inorder-traversal/index.ts";
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
 export default function findMode(root: TreeNode | null): number[] {
     const cnt = groupBy(inorderTraversal(root));
     const max = Math.max(...Object.values(cnt).map((v) => v.length));

find-mode-in-binary-search-tree/index.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import findMode from "./index.ts";
+
 Deno.test("find-mode-in-binary-search-tree", () => {
     assertEquals(
         [[1, null, 2, 2], [0], [300, 23, 2222, 22, 111, 303]]

find-mode-in-binary-search-tree/test.ts

@@ -1,6 +1,8 @@
 import { assertEquals } from "asserts";
+
 import { CustomFunction } from "./CustomFunction.ts";
 import findSolution from "./index.ts";
+
 Deno.test("find-positive-integer-solution-for-a-given-equation", () => {
     const inputs = [
         [1, 5],

find-positive-integer-solution-for-a-given-equation/test.ts

@@ -1,4 +1,5 @@
 import { BinaryHeap } from "https://deno.land/std@0.170.0/collections/binary_heap.ts";
+
 export default function findTheCity(
     n: number,
     edges: number[][],

find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/findTheCity.ts

@@ -1,4 +1,5 @@
 import { counter } from "../substring-with-concatenation-of-all-words/counter.ts";
+
 function findEvenNumbers(digits: number[]): number[] {
     if (digits.every((n) => n & 1)) return [];
     const cnt = counter(digits);

finding-3-digit-even-numbers/index.ts

@@ -1,8 +1,8 @@
 import { gcd } from "../max-points-on-a-line/greatest_common_divisor.ts";
 import { deduplication } from "./deduplication.ts";
-import { Fraction } from "./Fraction.ts";
+import { Fraction, FractionToString } from "./Fraction.ts";
 import { parseFraction } from "./parseFraction.ts";
-import { FractionToString } from "./Fraction.ts";
+
 export function fractionAdd(fractions: Fraction[]): Fraction {
     const denominator = deduplication(
         fractions.map((f) => f.denominator),

fraction-addition-and-subtraction/index.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "asserts";
+
 import fractionToDecimal from "./index.ts";
+
 Deno.test("fraction-to-recurring-decimal", () => {
     assertEquals(
         [

fraction-to-recurring-decimal/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "asserts";
+
 import guessNumberHigherOrLower from "./index.ts";
+
 Deno.test("guess-number-higher-or-lower", () => {
     const inputs = [[10, 6], [1, 1], [2, 1], [2147483647, 2147483647]];
     const outputs = [6, 1, 1, 2147483647];

guess-number-higher-or-lower/test.ts

@@ -1,6 +1,8 @@
+import { assert } from "asserts";
+
 import findSecretWord from "./index.ts";
 import { Master } from "./Master.ts";
-import { assert } from "asserts";
+
 Deno.test("guess-the-word", () => {
     const inputs: [secret: string, wordlist: string[], numguesses: number][] = [
         ["zzzzzz", [

guess-the-word/test.ts

@@ -1,4 +1,6 @@
-import { PrefixTreeInsert } from "../design-add-and-search-words-data-structure/PrefixTreeInsert.ts";
+import {
+    PrefixTreeInsert,
+} from "../design-add-and-search-words-data-structure/PrefixTreeInsert.ts";
 import { PrefixTree } from "./PrefixTree.ts";
 import { PrefixTreeSearch } from "./PrefixTreeSearch.ts";
 import { PrefixTreeStartsWith } from "./PrefixTreeStartsWith.ts";

implement-trie-prefix-tree/index.ts

@@ -1,8 +1,8 @@
-import inorderSuccessor from "./index.ts";
-import { Node } from "./Node.ts";
-import { also } from "./also.ts";
 import { assert, assertEquals } from "asserts";
-import { inorder } from "./Node.ts";
+
+import { also } from "./also.ts";
+import inorderSuccessor from "./index.ts";
+import { inorder, Node } from "./Node.ts";
 
 Deno.test("inorder-successor-in-bst-ii", () => {
     const map = new Map<number, Node>();