move-zeroes/

Author: masx200

README.md

@@ -30,6 +30,8 @@ https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/
 
 https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array
 
+https://leetcode-cn.com/problems/move-zeroes/
+
 #### 安装教程
 
 1. 安装`deno`

climbing-stairs/index.ts

@@ -1,6 +1,6 @@
 // My code goes here
 /** https://leetcode-cn.com/problems/climbing-stairs */
-export default function climbStairs(n: number): number | bigint {
+export default function climbing_stairs(n: number): number | bigint {
     const result = getClimbStairs(BigInt(n));
     if (result < Number.MAX_SAFE_INTEGER) {
         return Number(result);

climbing-stairs/test.ts

@@ -1,10 +1,10 @@
 import { assertStrictEquals } from "../deps.ts";
-import { climbStairs } from "../mod.ts";
+import { climbing_stairs } from "../mod.ts";
 
 Deno.test("climbing-stairs", () => {
     const examples: {
         input: number;
-        output: ReturnType<typeof climbStairs>;
+        output: ReturnType<typeof climbing_stairs>;
     }[] = [
         { input: 10, output: 89 },
         { input: 1, output: 1 },
@@ -16,6 +16,6 @@ Deno.test("climbing-stairs", () => {
         { input: 99, output: 354224848179261915075n },
     ];
     examples.forEach(({ input, output }) => {
-        assertStrictEquals(climbStairs(input), output);
+        assertStrictEquals(climbing_stairs(input), output);
     });
 });

fibonacci-number/index.ts

@@ -1,6 +1,6 @@
 // My code goes here
 /**https://leetcode-cn.com/problems/fibonacci-number/ */
-export default function fibonacciNumber(n: number): number | bigint {
+export default function fibonacci_Number(n: number): number | bigint {
     const result = getfbnq(BigInt(n));
     if (result < Number.MAX_SAFE_INTEGER) {
         return Number(result);

fibonacci-number/test.ts

@@ -1,10 +1,10 @@
 import { assertStrictEquals } from "../deps.ts";
-import { fibonacciNumber } from "../mod.ts";
+import { fibonacci_Number } from "../mod.ts";
 
 Deno.test("fibonacci-number", () => {
     const examples: {
         input: number;
-        output: ReturnType<typeof fibonacciNumber>;
+        output: ReturnType<typeof fibonacci_Number>;
     }[] = [
         { input: 2, output: 1 },
         { input: 3, output: 2 },
@@ -14,6 +14,6 @@ Deno.test("fibonacci-number", () => {
         { input: 99, output: 218922995834555169026n },
     ];
     examples.forEach(({ input, output }) => {
-        assertStrictEquals(fibonacciNumber(input), output);
+        assertStrictEquals(fibonacci_Number(input), output);
     });
 });

html-entity-parser/index.ts

@@ -1,5 +1,5 @@
 /**https://leetcode-cn.com/problems/html-entity-parser/*/
-export default function htmlEntityParser(text: string): string {
+export default function html_Entity_Parser(text: string): string {
     return text.replace(entityRegExp, replacer);
 }
 const replacer = (a: string) => {

html-entity-parser/test.ts

@@ -1,5 +1,5 @@
 import { assert } from "../deps.ts";
-import { htmlEntityParser } from "../mod.ts";
+import { html_Entity_Parser } from "../mod.ts";
 
 Deno.test("html-entity-parser", () => {
     const testData: { input: string; output: string }[] = [
@@ -27,7 +27,7 @@ Deno.test("html-entity-parser", () => {
 
     assert(
         testData.every(
-            ({ input, output }) => htmlEntityParser(input) === output,
+            ({ input, output }) => html_Entity_Parser(input) === output,
         ),
     );
 });

merge-sorted-array/test.ts

@@ -1,9 +1,9 @@
 import { assertEquals } from "../deps.ts";
-import { mergeSortedArray } from "../mod.ts";
+import { merge_Sorted_Array } from "../mod.ts";
 Deno.test("merge-sorted-array", () => {
     const examples: {
-        input: Parameters<typeof mergeSortedArray>;
-        output: Parameters<typeof mergeSortedArray>[0];
+        input: Parameters<typeof merge_Sorted_Array>;
+        output: Parameters<typeof merge_Sorted_Array>[0];
     }[] = [
         {
             input: [[1, 2, 3, 0, 0, 0], 3, [2, 5, 6], 3],
@@ -13,7 +13,7 @@ Deno.test("merge-sorted-array", () => {
         { input: [[0], 0, [1], 1], output: [1] },
     ];
     examples.forEach(({ input, output }) => {
-        mergeSortedArray(...input);
+        merge_Sorted_Array(...input);
         assertEquals(output, input[0]);
     });
 });

mod.ts

@@ -1,21 +1,21 @@
-import mergeSortedArray from "./merge-sorted-array/index.ts";
+import merge_Sorted_Array from "./merge-sorted-array/index.ts";
 import pow_x_n from "./powx-n/index.ts";
 
-import htmlEntityParser from "./html-entity-parser/index.ts";
+import html_Entity_Parser from "./html-entity-parser/index.ts";
 
-import reverseLinkedList from "./reverse-linked-list/index.ts";
+import reverse_Linked_List from "./reverse-linked-list/index.ts";
 
-import climbStairs from "./climbing-stairs/index.ts";
+import climbing_stairs from "./climbing-stairs/index.ts";
 import fei_bo_na_qi_shu_lie_lcof from "./fei-bo-na-qi-shu-lie-lcof/index.ts";
 
-import fibonacciNumber from "./fibonacci-number/index.ts";
-import twoSum from "./two-sum/index.ts";
-export { fibonacciNumber };
-export { twoSum };
-export { mergeSortedArray };
-export { htmlEntityParser };
-export { reverseLinkedList };
-export { climbStairs };
+import fibonacci_Number from "./fibonacci-number/index.ts";
+import two_Sum from "./two-sum/index.ts";
+export { fibonacci_Number };
+export { two_Sum };
+export { merge_Sorted_Array };
+export { html_Entity_Parser };
+export { reverse_Linked_List };
+export { climbing_stairs };
 export { fei_bo_na_qi_shu_lie_lcof };
 export { pow_x_n };
 export {
@@ -25,3 +25,4 @@ export {
 } from "./reverse-linked-list/index.ts";
 export { default as que_shi_de_shu_zi_lcof } from "./que-shi-de-shu-zi-lcof/index.ts";
 export { default as find_all_numbers_disappeared_in_an_array } from "./find-all-numbers-disappeared-in-an-array/index.ts";
+export { default as move_zeros } from "./move-zeroes/index.ts";

move-zeroes/index.ts

@@ -0,0 +1,18 @@
+/**
+ Do not return anything, modify nums in-place instead.
+ */
+export default function moveZeroes(nums: number[]): void {
+    if (nums.length === 0) {
+        return;
+    }
+    const notzeros = nums.filter((a) => a !== 0);
+    // const zeros=Array(nums.length-notzeros.length).fill(0)
+    nums.splice(0, notzeros.length, ...notzeros);
+    for (let i = notzeros.length; i < nums.length; i++) {
+        nums[i] = 0;
+    }
+    // nums.splice(notzeros.length,zeros.length,...zeros)
+    // nums.sort((a,b)=>{
+    //     return (a!==0&&b!==0)?0:(-Math.abs(a))||(Math.abs(b))
+    // })
+}