指定版本号

Author: masx200

README.md

@@ -72,6 +72,8 @@ deno task lint
 
 5.导入模块
 
+不指定版本号
+
 ```ts
 import {} from "https://gitee.com/masx200/leetcode-test/raw/master/mod.ts";
 ```
@@ -84,6 +86,20 @@ import {} from "https://github.com/masx200/leetcode-test/raw/master/mod.ts";
 import {} from "https://cdn.jsdelivr.net/gh/masx200/leetcode-test/mod.ts";
 ```
 
+指定版本号
+
+```ts
+import {} from "https://gitee.com/masx200/leetcode-test/raw/4.0.1/mod.ts";
+```
+
+```ts
+import {} from "https://github.com/masx200/leetcode-test/raw/4.0.1/mod.ts";
+```
+
+```ts
+import {} from "https://cdn.jsdelivr.net/gh/masx200/[email protected]/mod.ts";
+```
+
 6.使用举例
 
 ```ts

powx-n/index.ts

@@ -25,26 +25,25 @@ export default function myPow(x: number, n: number): number {
     //     return cached;
     // }
 
-    const result =
-        n === 1
-            ? x
-            : x < 0
-            ? (n % 2 === 0 ? 1 : -1) * myPow(-x, n)
-            : x === 1
-            ? 1
-            : x === 0
-            ? 0
-            : n === 0
-            ? 1
-            : n < 0
-            ? myPow(1 / x, -n)
-            : n % 2
-            ? x * myPow(x, n - 1)
-            : /* lazyMultiplyPositive(
+    const result = n === 1
+        ? x
+        : x < 0
+        ? (n % 2 === 0 ? 1 : -1) * myPow(-x, n)
+        : x === 1
+        ? 1
+        : x === 0
+        ? 0
+        : n === 0
+        ? 1
+        : n < 0
+        ? myPow(1 / x, -n)
+        : n % 2
+        ? x * myPow(x, n - 1)
+        : /* lazyMultiplyPositive(
                   () => x,
                   () => myPow(x, n - 1)
               ) */
-              myPow(x * x, Math.floor(n / 2));
+            myPow(x * x, Math.floor(n / 2));
     /* lazyMultiplyPositive(
             () => myPow(x, Math.floor(n / 2)),
             () => myPow(x, n - Math.floor(n / 2)),