https://leetcode.cn/problems/plus-one/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/plus-one/
+
 https://leetcode.cn/problems/a-number-after-a-double-reversal/
 
 https://leetcode.cn/problems/minimum-time-difference/

a-number-after-a-double-reversal/index.ts

@@ -1,3 +1,3 @@
-export default function isSameAfterReversals(num: number): boolean {
-    return num == 0 || num % 10 > 0;
-}
+export default function isSameAfterReversals(num: number): boolean {
+    return num == 0 || num % 10 > 0;
+}

abbreviating-the-product-of-a-range/test.ts

@@ -1,4 +1,5 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import abbreviateProduct from "./index.ts";
 
 Deno.test("abbreviating-the-product-of-a-range", () => {

concatenated-words/index.ts

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

concatenation-of-array/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "asserts";
+
 import getConcatenation from "./index.ts";
+
 Deno.test("concatenation-of-array", () => {
     assertEquals(
         [[1, 2, 1], [1, 3, 2, 1], [

deno.json

@@ -11,7 +11,7 @@
     },
     "importMap": "import_map.json",
     "tasks": {
-        "udd": " deno run -A https://deno.land/x/udd/main.ts  '*.json' deps.ts '*.ts' '*/*.ts'",
+        "udd": " deno run -A https://deno.land/x/udd@0.7.5/main.ts  '*.json' deps.ts '*.ts' '*/*.ts'",
         "install-udd": "deno install -A -f -n udd https://deno.land/x/[email protected]/main.ts",
         "fmt": " deno fmt --config deno.json",
         "test": "deno test  --parallel --unstable -A --config deno.json",

design-an-expression-tree-with-evaluate-function/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import { default as TreeBuilder } from "./index.ts";
+
 Deno.test("design-an-expression-tree-with-evaluate-function", () => {
     assertEquals(
         [

er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/test.ts

@@ -1,7 +1,9 @@
 import { assertEquals } from "asserts";
+
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import { ArrayToCircularDoublyTreeList } from "./ArrayToCircularDoublyTreeList.ts";
 import treeToDoublyList from "./index.ts";
+
 Deno.test("er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", () => {
     const inputs = [
         [

evaluate-reverse-polish-notation/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import evalRPN from "./index.ts";
+
 Deno.test("evaluate-reverse-polish-notation", () => {
     assertEquals(
         [

find-first-and-last-position-of-element-in-sorted-array/test.ts

@@ -1,5 +1,7 @@
 import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+
 import searchRange from "./index.ts";
+
 Deno.test("find-first-and-last-position-of-element-in-sorted-array", () => {
     const inputs: [nums: number[], target: number][] = [
         [[5, 7, 7, 8, 8, 10], 8],