https://leetcode-cn.com/problems/reverse-linked-list/ https://leetcode-cn.com/problems/html-entity-parser/

Author: masx200

.vscode/settings.json

@@ -1,7 +1,7 @@
 {
-  "deno.enable": true,
-  "deno.lint": true,
-  "deno.unstable": true,
-  "deno.config": "deno.json",
-  "deno.importMap": "import_map.json"
+    "deno.enable": true,
+    "deno.lint": true,
+    "deno.unstable": true,
+    "deno.config": "deno.json",
+    "deno.importMap": "import_map.json"
 }

README.md

@@ -8,6 +8,12 @@ leetcode测试
 
 软件架构说明
 
+包含的内容如下
+
+https://leetcode-cn.com/problems/reverse-linked-list/
+
+https://leetcode-cn.com/problems/html-entity-parser/
+
 #### 安装教程
 
 1. 安装`deno`
@@ -23,7 +29,7 @@ https://deno.land/x/udd#installation
 1. 测试
 
 ```
-deno test 
+deno task test
 ```
 
 2.升级依赖
@@ -32,6 +38,12 @@ deno test
 deno task udd
 ```
 
+3.格式化
+
+```
+deno task fmt
+```
+
 #### 参与贡献
 
 1. Fork 本仓库

deno.json

@@ -1,7 +1,15 @@
 {
-  "importMap": "import_map.json",
-  "tasks": {
-    "udd": "udd '*.ts'",
-    "install-udd": "deno install -A -f -n udd https://deno.land/x/[email protected]/main.ts"
-  }
+    "importMap": "import_map.json",
+    "tasks": {
+        "udd": "udd '*.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 --config deno.json"
+    },
+    "fmt": {
+        "options": {
+            "indentWidth": 4,
+            "singleQuote": false
+        }
+    }
 }

deps.ts

@@ -1,2 +1,5 @@
-import { assert } from "https://deno.land/[email protected]/testing/asserts.ts";
-export { assert };
+import {
+    assert,
+    equal,
+} from "https://deno.land/[email protected]/testing/asserts.ts";
+export { assert, equal };

fmt.cmd

@@ -1 +1 @@
-deno fmt
+deno fmt --config deno.json

html-entity-parser/index.ts

@@ -1,19 +1,17 @@
-/*https://leetcode-cn.com/problems/html-entity-parser/*/
-export default entityParser;
-
-function entityParser(text: string): string {
-  return text.replace(entityRegExp, replacer);
+/**https://leetcode-cn.com/problems/html-entity-parser/*/
+export default function entityParser(text: string): string {
+    return text.replace(entityRegExp, replacer);
 }
 const replacer = (a: string) => {
-  const value = translator.get(a);
-  return value ?? a;
+    const value = translator.get(a);
+    return value ?? a;
 };
 const translator = new Map<string, string>([
-  ["&quot;", '"'],
-  ["&apos;", "'"],
-  ["&amp;", "&"],
-  ["&gt;", ">"],
-  ["&lt;", "<"],
-  ["&frasl;", "/"],
+    ["&quot;", '"'],
+    ["&apos;", "'"],
+    ["&amp;", "&"],
+    ["&gt;", ">"],
+    ["&lt;", "<"],
+    ["&frasl;", "/"],
 ]);
 const entityRegExp = /\&[a-z]+\;/g;

html-entity-parser/test.ts

@@ -1,31 +1,33 @@
 import { assert } from "../deps.ts";
-import entityParser from "./index.ts";
+import { htmlEntityParser } from "../mod.ts";
 
 Deno.test("html-entity-parser", () => {
-  const testData: { input: string; output: string }[] = [
-    {
-      input: "& is an HTML entity but &ambassador; is not.",
-      output: "& is an HTML entity but &ambassador; is not.",
-    },
-    {
-      input: "and I quote: "..."",
-      output: 'and I quote: "..."',
-    },
-    {
-      input: "Stay home! Practice on Leetcode :)",
-      output: "Stay home! Practice on Leetcode :)",
-    },
-    {
-      input: "x > y && x < y is always false",
-      output: "x > y && x < y is always false",
-    },
-    {
-      input: "leetcode.com&frasl;problemset&frasl;all",
-      output: "leetcode.com/problemset/all",
-    },
-  ];
+    const testData: { input: string; output: string }[] = [
+        {
+            input: "&amp; is an HTML entity but &ambassador; is not.",
+            output: "& is an HTML entity but &ambassador; is not.",
+        },
+        {
+            input: "and I quote: &quot;...&quot;",
+            output: 'and I quote: "..."',
+        },
+        {
+            input: "Stay home! Practice on Leetcode :)",
+            output: "Stay home! Practice on Leetcode :)",
+        },
+        {
+            input: "x &gt; y &amp;&amp; x &lt; y is always false",
+            output: "x > y && x < y is always false",
+        },
+        {
+            input: "leetcode.com&frasl;problemset&frasl;all",
+            output: "leetcode.com/problemset/all",
+        },
+    ];
 
-  assert(
-    testData.every(({ input, output }) => entityParser(input) === output),
-  );
+    assert(
+        testData.every(
+            ({ input, output }) => htmlEntityParser(input) === output,
+        ),
+    );
 });

import_map.json

@@ -1,5 +1,4 @@
 {
-  "imports": {
-    "asserts": "https://deno.land/[email protected]/testing/asserts.ts"
-  }
+    "imports": {
+    }
 }

mod.ts

@@ -1,2 +1,5 @@
-import entityParser from "./html-entity-parser/index.ts";
-export { entityParser };
+import htmlEntityParser from "./html-entity-parser/index.ts";
+export { htmlEntityParser };
+export * from "./reverse-linked-list/index.ts";
+import reverseLinkedList from "./reverse-linked-list/index.ts";
+export { reverseLinkedList };

reverse-linked-list/index.ts

@@ -0,0 +1,55 @@
+// My code goes here
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+export class ListNode {
+    val: number;
+    next: ListNode | null;
+    constructor(val?: number, next?: ListNode | null) {
+        this.val = val === undefined ? 0 : val;
+        this.next = next === undefined ? null : next;
+    }
+}
+/**https://leetcode-cn.com/problems/reverse-linked-list/ */
+export default function reverseLinkedList(
+    head: ListNode | null,
+): ListNode | null {
+    if (null === head) {
+        return null;
+    }
+
+    return ArrayToListNode(Array.from(ListNodeToArray(head)).reverse());
+}
+
+export function ArrayToListNode(array: Array<number>): ListNode | null {
+    if (array.length === 0) {
+        return null;
+    }
+    const list = new ListNode(array[0]);
+    array.slice(1).reduce((p, v) => {
+        const l = new ListNode(v);
+        p.next = l;
+        return l;
+    }, list);
+    return list;
+}
+export function ListNodeToArray(list: ListNode | null): Array<number> {
+    if (list === null) {
+        return [];
+    }
+    const array: Array<number> = [];
+    let temp: ListNode | null = list;
+    while (temp) {
+        array.push(temp.val);
+        temp = temp.next;
+    }
+    return array;
+}