From 552a44fa94cbd2e17720757451f79078ab9f5a83 Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:12:32 +0800 Subject: [PATCH 1/7] Update TypeScript style (Chapter of Array and Linkedlist) --- .../chapter_array_and_linkedlist/linked_list.ts | 4 ++++ codes/typescript/module/ListNode.ts | 10 +++++++++- 2 files changed, 13 insertions(+), 1 deletion(-) diff --git a/codes/typescript/chapter_array_and_linkedlist/linked_list.ts b/codes/typescript/chapter_array_and_linkedlist/linked_list.ts index d2c339df0..484322581 100644 --- a/codes/typescript/chapter_array_and_linkedlist/linked_list.ts +++ b/codes/typescript/chapter_array_and_linkedlist/linked_list.ts @@ -7,12 +7,14 @@ import ListNode from '../module/ListNode'; import { printLinkedList } from '../module/PrintUtil'; +/* 在链表的结点 n0 之后插入结点 P */ function insert(n0: ListNode, P: ListNode): void { const n1 = n0.next; n0.next = P; P.next = n1; } +/* 删除链表的结点 n0 之后的首个结点 */ function remove(n0: ListNode): void { if (!n0.next) { return; @@ -23,6 +25,7 @@ function remove(n0: ListNode): void { n0.next = n1; } +/* 访问链表中索引为 index 的结点 */ function access(head: ListNode | null, index: number): ListNode | null { for (let i = 0; i < index; i++) { if (!head) { @@ -33,6 +36,7 @@ function access(head: ListNode | null, index: number): ListNode | null { return head; } +/* 在链表中查找值为 target 的首个结点 */ function find(head: ListNode | null, target: number): number { let index = 0; while (head !== null) { diff --git a/codes/typescript/module/ListNode.ts b/codes/typescript/module/ListNode.ts index 543f1cf3a..d6d60616d 100644 --- a/codes/typescript/module/ListNode.ts +++ b/codes/typescript/module/ListNode.ts @@ -1,4 +1,12 @@ -// Definition for singly-linked list. +/* + * File: ListNode.ts + * Created Time: 2022-12-10 + * Author: Justin (xiefahit@gmail.com) + */ + +/** + * Definition for a singly-linked list node + */ export default class ListNode { val: number; next: ListNode | null; From 80ef96da69c7f6a62f22e071034ed2ceb243184a Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:13:12 +0800 Subject: [PATCH 2/7] Update JavaScript style (Chapter of Array) --- .../chapter_array_and_linkedlist/array.js | 84 +++++++++---------- 1 file changed, 41 insertions(+), 43 deletions(-) diff --git a/codes/javascript/chapter_array_and_linkedlist/array.js b/codes/javascript/chapter_array_and_linkedlist/array.js index 4cf1b29fa..edc78d9b4 100644 --- a/codes/javascript/chapter_array_and_linkedlist/array.js +++ b/codes/javascript/chapter_array_and_linkedlist/array.js @@ -5,30 +5,30 @@ */ /* 随机访问元素 */ -function randomAccess(nums){ +function randomAccess(nums) { // 在区间 [0, nums.length) 中随机抽取一个数字 - const random_index = Math.floor(Math.random() * nums.length) + const random_index = Math.floor(Math.random() * nums.length); // 获取并返回随机元素 - random_num = nums[random_index] - return random_num + const random_num = nums[random_index]; + return random_num; } /* 扩展数组长度 */ // 请注意，Python 的 list 是动态数组，可以直接扩展 // 为了方便学习，本函数将 list 看作是长度不可变的数组 -function extend(nums, enlarge){ - // 初始化一个扩展长度后的数组 - let res = new Array(nums.length + enlarge).fill(0) - // 将原数组中的所有元素复制到新数组 - for(let i=0; i= index; i--) { nums[i] = nums[i - 1]; @@ -38,62 +38,60 @@ function insert(nums, num, index){ } /* 删除索引 index 处元素 */ -function remove(nums, index){ +function remove(nums, index) { // 把索引 index 之后的所有元素向前移动一位 for (let i = index; i < nums.length - 1; i++) { - nums[i] = nums[i + 1] - } + nums[i] = nums[i + 1]; + } } - + /* 遍历数组 */ -function traverse(nums){ - let count = 0 +function traverse(nums) { + let count = 0; // 通过索引遍历数组 for (let i = 0; i < nums.length; i++) { - count++; + count++; } // 直接遍历数组 - for(let num of nums){ - count += 1 - } + for (let num of nums) { + count += 1; + } } /* 在数组中查找指定元素 */ -function find(nums, target){ +function find(nums, target) { for (let i = 0; i < nums.length; i++) { - if (nums[i] == target) - return i; + if (nums[i] == target) return i; } - return -1 + return -1; } - /* Driver Codes*/ /* 初始化数组 */ -var arr = new Array(5).fill(0) -console.log("数组 arr =", arr) -var nums = [1, 3, 2, 5, 4] -console.log("数组 nums =", nums) +let arr = new Array(5).fill(0); +console.log('数组 arr =', arr); +let nums = [1, 3, 2, 5, 4]; +console.log('数组 nums =', nums); /* 随机访问 */ -random_num = randomAccess(nums) -console.log("在 nums 中获取随机元素", random_num) +const random_num = randomAccess(nums); +console.log('在 nums 中获取随机元素', random_num); /* 长度扩展 */ -nums = extend(nums, 3) -console.log("将数组长度扩展至 8 ，得到 nums =", nums) +nums = extend(nums, 3); +console.log('将数组长度扩展至 8 ，得到 nums =', nums); /* 插入元素 */ -insert(nums, 6, 3) -console.log("在索引 3 处插入数字 6 ，得到 nums =", nums) +insert(nums, 6, 3); +console.log('在索引 3 处插入数字 6 ，得到 nums =', nums); /* 删除元素 */ -remove(nums, 2) -console.log("删除索引 2 处的元素，得到 nums =", nums) +remove(nums, 2); +console.log('删除索引 2 处的元素，得到 nums =', nums); /* 遍历数组 */ -traverse(nums) +traverse(nums); /* 查找元素 */ -var index = find(nums, 3) -console.log("在 nums 中查找元素 3 ，得到索引 =", index) +var index = find(nums, 3); +console.log('在 nums 中查找元素 3 ，得到索引 =', index); From f6939dab899302c1b6ed904431e987b961154dc8 Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:13:49 +0800 Subject: [PATCH 3/7] Add the remain JavaScript code (Chapter of Array and Linkedlist) --- .../linked_list.js | 84 ++++++++++ .../chapter_array_and_linkedlist/list.js | 64 ++++++++ .../chapter_array_and_linkedlist/my_list.js | 145 ++++++++++++++++++ codes/javascript/include/ListNode.js | 17 ++ 4 files changed, 310 insertions(+) create mode 100644 codes/javascript/chapter_array_and_linkedlist/linked_list.js create mode 100644 codes/javascript/chapter_array_and_linkedlist/list.js create mode 100644 codes/javascript/chapter_array_and_linkedlist/my_list.js create mode 100644 codes/javascript/include/ListNode.js diff --git a/codes/javascript/chapter_array_and_linkedlist/linked_list.js b/codes/javascript/chapter_array_and_linkedlist/linked_list.js new file mode 100644 index 000000000..2315b41f0 --- /dev/null +++ b/codes/javascript/chapter_array_and_linkedlist/linked_list.js @@ -0,0 +1,84 @@ +/* + * File: linked_list.js + * Created Time: 2022-12-12 + * Author: Justin (xiefahit@gmail.com) + */ + +const ListNode = require('../include/ListNode.js'); +const { printLinkedList } = require('../include/PrintUtil.js'); + +/* 在链表的结点 n0 之后插入结点 P */ +function insert(n0, P) { + const n1 = n0.next; + n0.next = P; + P.next = n1; +} + +/* 删除链表的结点 n0 之后的首个结点 */ +function remove(n0) { + if (!n0.next) { + return; + } + // n0 -> P -> n1 + const P = n0.next; + const n1 = P.next; + n0.next = n1; +} + +/* 访问链表中索引为 index 的结点 */ +function access(head, index) { + for (let i = 0; i < index; i++) { + if (!head) { + return null; + } + head = head.next; + } + return head; +} + +/* 在链表中查找值为 target 的首个结点 */ +function find(head, target) { + let index = 0; + while (head !== null) { + if (head.val === target) { + return index; + } + head = head.next; + index += 1; + } + return -1; +} + +/* Driver Code */ +/* 初始化链表 */ +// 初始化各个结点 +const n0 = new ListNode(1); +const n1 = new ListNode(3); +const n2 = new ListNode(2); +const n3 = new ListNode(5); +const n4 = new ListNode(4); +// 构建引用指向 +n0.next = n1; +n1.next = n2; +n2.next = n3; +n3.next = n4; +console.log('初始化的链表为'); +printLinkedList(n0); + +/* 插入结点 */ +insert(n0, new ListNode(0)); +console.log('插入结点后的链表为'); +printLinkedList(n0); + +/* 删除结点 */ +remove(n0); +console.log('删除结点后的链表为'); +printLinkedList(n0); + +/* 访问结点 */ +const node = access(n0, 3); +console.log(`链表中索引 3 处的结点的值 = ${node?.val}`); + +/* 查找结点 */ +const index = find(n0, 2); +console.log(`链表中值为 2 的结点的索引 = ${index}`); diff --git a/codes/javascript/chapter_array_and_linkedlist/list.js b/codes/javascript/chapter_array_and_linkedlist/list.js new file mode 100644 index 000000000..0ec1cf348 --- /dev/null +++ b/codes/javascript/chapter_array_and_linkedlist/list.js @@ -0,0 +1,64 @@ +/* + * File: list.js + * Created Time: 2022-12-12 + * Author: Justin (xiefahit@gmail.com) + */ + +/* 初始化列表 */ +const list = [1, 3, 2, 5, 4]; +console.log(`列表 list = ${list}`); + +/* 访问元素 */ +const num = list[1]; +console.log(`访问索引 1 处的元素，得到 num = ${num}`); + +/* 更新元素 */ +list[1] = 0; +console.log(`将索引 1 处的元素更新为 0 ，得到 list = ${list}`); + +/* 清空列表 */ +list.length = 0; +console.log(`清空列表后 list = ${list}`); + +/* 尾部添加元素 */ +list.push(1); +list.push(3); +list.push(2); +list.push(5); +list.push(4); +console.log(`添加元素后 list = ${list}`); + +/* 中间插入元素 */ +list.splice(3, 0, 6); +console.log(`在索引 3 处插入数字 6 ，得到 list = ${list}`); + +/* 删除元素 */ +list.splice(3, 1); +console.log(`删除索引 3 处的元素，得到 list = ${list}`); + +/* 通过索引遍历列表 */ +let count = 0; +for (let i = 0; i < list.length; i++) { + count++; +} + +/* 直接遍历列表元素 */ +count = 0; +for (const n of list) { + count++; +} + +/* 直接遍历列表元素 */ +count = 0; +for (const n of list) { + count++; +} + +/* 拼接两个列表 */ +const list1 = [6, 8, 7, 10, 9]; +list.push(...list1); +console.log(`将列表 list1 拼接到 list 之后，得到 list = ${list}`); + +/* 排序列表 */ +list.sort((a, b) => a - b); +console.log(`排序列表后 list = ${list}`); diff --git a/codes/javascript/chapter_array_and_linkedlist/my_list.js b/codes/javascript/chapter_array_and_linkedlist/my_list.js new file mode 100644 index 000000000..fc974f35c --- /dev/null +++ b/codes/javascript/chapter_array_and_linkedlist/my_list.js @@ -0,0 +1,145 @@ +/* + * File: my_list.js + * Created Time: 2022-12-12 + * Author: Justin (xiefahit@gmail.com) + */ + +/* 列表类简易实现 */ +class MyList { + #nums = new Array(); // 数组（存储列表元素） + #capacity = 10; // 列表容量 + #size = 0; // 列表长度（即当前元素数量） + #extendRatio = 2; // 每次列表扩容的倍数 + + /* 构造函数 */ + constructor() { + this.#nums = new Array(this.#capacity); + } + + /* 获取列表长度（即当前元素数量）*/ + size() { + return this.#size; + } + + /* 获取列表容量 */ + capacity() { + return this.#capacity; + } + + /* 访问元素 */ + get(index) { + // 索引如果越界则抛出异常，下同 + if (index >= this.#size) { + throw new Error('索引越界'); + } + return this.#nums[index]; + } + + /* 更新元素 */ + set(index, num) { + if (index >= this._size) throw new Error('索引越界'); + this.#nums[index] = num; + } + + /* 尾部添加元素 */ + add(num) { + // 如果长度等于容量，则需要扩容 + if (this.#size === this.#capacity) { + this.extendCapacity(); + } + // 将新元素添加到列表尾部 + this.#nums[this.#size] = num; + this.#size++; + } + + /* 中间插入元素 */ + insert(index, num) { + if (index >= this.#size) { + throw new Error('索引越界'); + } + // 元素数量超出容量时，触发扩容机制 + if (this.#size === this.#capacity) { + this.extendCapacity(); + } + // 将索引 index 以及之后的元素都向后移动一位 + for (let j = this.#size - 1; j >= index; j--) { + this.#nums[j + 1] = this.#nums[j]; + } + // 更新元素数量 + this.#nums[index] = num; + this.#size++; + } + + /* 删除元素 */ + remove(index) { + if (index >= this.#size) throw new Error('索引越界'); + let num = this.#nums[index]; + // 将索引 index 之后的元素都向前移动一位 + for (let j = index; j < this.#size - 1; j++) { + this.#nums[j] = this.#nums[j + 1]; + } + // 更新元素数量 + this.#size--; + // 返回被删除元素 + return num; + } + + /* 列表扩容 */ + extendCapacity() { + // 新建一个长度为 size 的数组，并将原数组拷贝到新数组 + this.#nums = this.#nums.concat( + new Array(this.capacity() * (this.#extendRatio - 1)) + ); + // 更新列表容量 + this.#capacity = this.#nums.length; + } + + /* 将列表转换为数组 */ + toArray() { + let size = this.size(); + // 仅转换有效长度范围内的列表元素 + let nums = new Array(size); + for (let i = 0; i < size; i++) { + nums[i] = this.get(i); + } + return nums; + } +} + +/* Driver Code */ +/* 初始化列表 */ +let list = new MyList(); +/* 尾部添加元素 */ +list.add(1); +list.add(3); +list.add(2); +list.add(5); +list.add(4); +console.log( + `列表 list = ${list.toArray()} ，容量 = ${list.capacity()} ，长度 = ${list.size()}` +); + +/* 中间插入元素 */ +list.insert(3, 6); +console.log(`在索引 3 处插入数字 6 ，得到 list = ${list.toArray()}`); + +/* 删除元素 */ +list.remove(3); +console.log(`删除索引 3 处的元素，得到 list = ${list.toArray()}`); + +/* 访问元素 */ +let num = list.get(1); +console.log(`访问索引 1 处的元素，得到 num = ${num}`); + +/* 更新元素 */ +list.set(1, 0); +console.log(`将索引 1 处的元素更新为 0 ，得到 list = ${list.toArray()}`); + +/* 测试扩容机制 */ +for (let i = 0; i < 10; i++) { + // 在 i = 5 时，列表长度将超出列表容量，此时触发扩容机制 + list.add(i); +} +console.log( + `扩容后的列表 list = ${list.toArray()} ，容量 = ${list.capacity()} ，长度 = ${list.size()}` +); diff --git a/codes/javascript/include/ListNode.js b/codes/javascript/include/ListNode.js new file mode 100644 index 000000000..2bd347966 --- /dev/null +++ b/codes/javascript/include/ListNode.js @@ -0,0 +1,17 @@ +/* + * File: ListNode.js + * Created Time: 2022-12-12 + * Author: Justin (xiefahit@gmail.com) + */ + +/** + * Definition for a singly-linked list node + */ +class ListNode { + constructor(val, next) { + this.val = val === undefined ? 0 : val; + this.next = next === undefined ? null : next; + } +} + +module.exports = ListNode; From 5fbdff1b41850ad658fbbc9cf75dc596559db1bf Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:25:07 +0800 Subject: [PATCH 4/7] Update JavaScript and TypeScript code to docs (Chapter of Array) --- docs/chapter_array_and_linkedlist/array.md | 79 +++++++++++----------- 1 file changed, 39 insertions(+), 40 deletions(-) diff --git a/docs/chapter_array_and_linkedlist/array.md b/docs/chapter_array_and_linkedlist/array.md index c6f2feca7..108261fb0 100644 --- a/docs/chapter_array_and_linkedlist/array.md +++ b/docs/chapter_array_and_linkedlist/array.md @@ -50,16 +50,16 @@ comments: true ```javascript title="array.js" /* 初始化数组 */ - var arr = new Array(5).fill(0) - var nums = [1, 3, 2, 5, 4] + let arr = new Array(5).fill(0); + let nums = [1, 3, 2, 5, 4]; ``` === "TypeScript" ```typescript title="array.ts" /* 初始化数组 */ - let arr: number[] = new Array(5).fill(0) - let nums: number[] = [1, 3, 2, 5, 4] + let arr: number[] = new Array(5).fill(0); + let nums: number[] = [1, 3, 2, 5, 4]; ``` === "C" @@ -138,12 +138,12 @@ elementAddr = firtstElementAddr + elementLength * elementIndex ```javascript title="array.js" /* 随机返回一个数组元素 */ - function randomAccess(nums){ + function randomAccess(nums) { // 在区间 [0, nums.length) 中随机抽取一个数字 - const random_index = Math.floor(Math.random() * nums.length) + const random_index = Math.floor(Math.random() * nums.length); // 获取并返回随机元素 - random_num = nums[random_index] - return random_num + const random_num = nums[random_index]; + return random_num; } ``` @@ -153,10 +153,10 @@ elementAddr = firtstElementAddr + elementLength * elementIndex /* 随机返回一个数组元素 */ function randomAccess(nums: number[]): number { // 在区间 [0, nums.length) 中随机抽取一个数字 - const random_index = Math.floor(Math.random() * nums.length) + const random_index = Math.floor(Math.random() * nums.length); // 获取并返回随机元素 - const random_num = nums[random_index] - return random_num + const random_num = nums[random_index]; + return random_num; } ``` @@ -234,15 +234,15 @@ elementAddr = firtstElementAddr + elementLength * elementIndex ```javascript title="array.js" /* 扩展数组长度 */ - function extend(nums, enlarge){ + function extend(nums, enlarge) { // 初始化一个扩展长度后的数组 - let res = new Array(nums.length + enlarge).fill(0) + const res = new Array(nums.length + enlarge).fill(0); // 将原数组中的所有元素复制到新数组 - for(let i=0; i= index; i--) { nums[i] = nums[i - 1]; @@ -364,12 +364,12 @@ elementAddr = firtstElementAddr + elementLength * elementIndex // 将 num 赋给 index 处元素 nums[index] = num; } - + /* 删除索引 index 处元素 */ - function remove(nums, index){ + function remove(nums, index) { // 把索引 index 之后的所有元素向前移动一位 for (let i = index; i < nums.length - 1; i++) { - nums[i] = nums[i + 1] + nums[i] = nums[i + 1]; } } ``` @@ -381,17 +381,17 @@ elementAddr = firtstElementAddr + elementLength * elementIndex function insert(nums: number[], num: number, index: number): void { // 把索引 index 以及之后的所有元素向后移动一位 for (let i = nums.length - 1; i >= index; i--) { - nums[i] = nums[i - 1] + nums[i] = nums[i - 1]; } // 将 num 赋给 index 处元素 - nums[index] = num + nums[index] = num; } /* 删除索引 index 处元素 */ function remove(nums: number[], index: number): void { // 把索引 index 之后的所有元素向前移动一位 for (let i = index; i < nums.length - 1; i++) { - nums[i] = nums[i + 1] + nums[i] = nums[i + 1]; } } ``` @@ -466,15 +466,15 @@ elementAddr = firtstElementAddr + elementLength * elementIndex ```javascript title="array.js" /* 遍历数组 */ - function traverse(nums){ - let count = 0 + function traverse(nums) { + let count = 0; // 通过索引遍历数组 for (let i = 0; i < nums.length; i++) { count++; } // 直接遍历数组 - for(let num of nums){ - count += 1 + for (let num of nums) { + count += 1; } } ``` @@ -484,14 +484,14 @@ elementAddr = firtstElementAddr + elementLength * elementIndex ```typescript title="array.ts" /* 遍历数组 */ function traverse(nums: number[]): void { - let count = 0 + let count = 0; // 通过索引遍历数组 for (let i = 0; i < nums.length; i++) { - count++ + count++; } // 直接遍历数组 for(let num of nums){ - count += 1 + count += 1; } } ``` @@ -557,12 +557,11 @@ elementAddr = firtstElementAddr + elementLength * elementIndex ```javascript title="array.js" /* 在数组中查找指定元素 */ - function find(nums, target){ + function find(nums, target) { for (let i = 0; i < nums.length; i++) { - if (nums[i] == target) - return i; + if (nums[i] == target) return i; } - return -1 + return -1; } ``` @@ -573,10 +572,10 @@ elementAddr = firtstElementAddr + elementLength * elementIndex function find(nums: number[], target: number): number { for (let i = 0; i < nums.length; i++) { if (nums[i] === target) { - return i + return i; } } - return -1 + return -1; } ``` From 0688cf874c5ed37be864744e27eb55609696cead Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:26:56 +0800 Subject: [PATCH 5/7] Add JavaScript code to docs (Chapter of linked_list) --- .../linked_list.md | 72 +++++++++++++++++-- 1 file changed, 66 insertions(+), 6 deletions(-) diff --git a/docs/chapter_array_and_linkedlist/linked_list.md b/docs/chapter_array_and_linkedlist/linked_list.md index 8d1d979d9..4b33b7bb1 100644 --- a/docs/chapter_array_and_linkedlist/linked_list.md +++ b/docs/chapter_array_and_linkedlist/linked_list.md @@ -57,7 +57,13 @@ comments: true === "JavaScript" ```js title="" - + /* 链表结点结构体 */ + class ListNode { + constructor(val, next) { + this.val = val === undefined ? 0 : val; + this.next = next === undefined ? null : next; + } + } ``` === "TypeScript" @@ -154,7 +160,18 @@ comments: true === "JavaScript" ```js title="" - + /* 初始化链表 1 -> 3 -> 2 -> 5 -> 4 */ + // 初始化各个结点 + const n0 = new ListNode(1); + const n1 = new ListNode(3); + const n2 = new ListNode(2); + const n3 = new ListNode(5); + const n4 = new ListNode(4); + // 构建引用指向 + n0.next = n1; + n1.next = n2; + n2.next = n3; + n3.next = n4; ``` === "TypeScript" @@ -264,7 +281,23 @@ comments: true === "JavaScript" ```js title="" + /* 在链表的结点 n0 之后插入结点 P */ + function insert(n0, P) { + const n1 = n0.next; + n0.next = P; + P.next = n1; + } + /* 删除链表的结点 n0 之后的首个结点 */ + function remove(n0) { + if (!n0.next) { + return; + } + // n0 -> P -> n1 + const P = n0.next; + const n1 = P.next; + n0.next = n1; + } ``` === "TypeScript" @@ -353,7 +386,16 @@ comments: true === "JavaScript" ```js title="" - + /* 访问链表中索引为 index 的结点 */ + function access(head, index) { + for (let i = 0; i < index; i++) { + if (!head) { + return null; + } + head = head.next; + } + return head; + } ``` === "TypeScript" @@ -444,7 +486,18 @@ comments: true === "JavaScript" ```js title="" - + /* 在链表中查找值为 target 的首个结点 */ + function find(head, target) { + let index = 0; + while (head !== null) { + if (head.val === target) { + return index; + } + head = head.next; + index += 1; + } + return -1; + } ``` === "TypeScript" @@ -528,7 +581,14 @@ comments: true === "JavaScript" ```js title="" - + /* 双向链表结点类 */ + class ListNode { + constructor(val, next, prev) { + this.val = val === undefined ? 0 : val; // 结点值 + this.next = next === undefined ? null : next; // 指向后继结点的引用 + this.prev = prev === undefined ? null : prev; // 指向前驱结点的引用 + } + } ``` === "TypeScript" @@ -539,7 +599,7 @@ comments: true val: number; next: ListNode | null; prev: ListNode | null; - constructor(val?: number, next?: ListNode | null) { + constructor(val?: number, next?: ListNode | null, prev?: ListNode | null) { this.val = val === undefined ? 0 : val; // 结点值 this.next = next === undefined ? null : next; // 指向后继结点的引用 this.prev = prev === undefined ? null : prev; // 指向前驱结点的引用 From aceed8f87f4bfd864d1d71fb8bdcf8b02bd6ecf6 Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:30:55 +0800 Subject: [PATCH 6/7] Add JavaScript code to docs (Chapter of list) --- docs/chapter_array_and_linkedlist/list.md | 127 +++++++++++++++++++++- 1 file changed, 124 insertions(+), 3 deletions(-) diff --git a/docs/chapter_array_and_linkedlist/list.md b/docs/chapter_array_and_linkedlist/list.md index e9d02e7b7..c2631048e 100644 --- a/docs/chapter_array_and_linkedlist/list.md +++ b/docs/chapter_array_and_linkedlist/list.md @@ -44,7 +44,8 @@ comments: true === "JavaScript" ```js title="list.js" - + /* 初始化列表 */ + const list = [1, 3, 2, 5, 4]; ``` === "TypeScript" @@ -107,7 +108,11 @@ comments: true === "JavaScript" ```js title="list.js" + /* 访问元素 */ + const num = list[1]; + /* 更新元素 */ + list[1] = 0; ``` === "TypeScript" @@ -203,7 +208,21 @@ comments: true === "JavaScript" ```js title="list.js" + /* 清空列表 */ + list.length = 0; + + /* 尾部添加元素 */ + list.push(1); + list.push(3); + list.push(2); + list.push(5); + list.push(4); + + /* 中间插入元素 */ + list.splice(3, 0, 6); + /* 删除元素 */ + list.splice(3, 1); ``` === "TypeScript" @@ -295,7 +314,17 @@ comments: true === "JavaScript" ```js title="list.js" + /* 通过索引遍历列表 */ + let count = 0; + for (let i = 0; i < list.length; i++) { + count++; + } + /* 直接遍历列表元素 */ + count = 0; + for (const n of list) { + count++; + } ``` === "TypeScript" @@ -362,7 +391,9 @@ comments: true === "JavaScript" ```js title="list.js" - + /* 拼接两个列表 */ + const list1 = [6, 8, 7, 10, 9]; + list.push(...list1); ``` === "TypeScript" @@ -417,7 +448,8 @@ comments: true === "JavaScript" ```js title="list.js" - + /* 排序列表 */ + list.sort((a, b) => a - b); ``` === "TypeScript" @@ -713,7 +745,96 @@ comments: true === "JavaScript" ```js title="my_list.js" + /* 列表类简易实现 */ + class MyList { + #nums = new Array(); // 数组（存储列表元素） + #capacity = 10; // 列表容量 + #size = 0; // 列表长度（即当前元素数量） + #extendRatio = 2; // 每次列表扩容的倍数 + + /* 构造函数 */ + constructor() { + this.#nums = new Array(this.#capacity); + } + /* 获取列表长度（即当前元素数量）*/ + size() { + return this.#size; + } + + /* 获取列表容量 */ + capacity() { + return this.#capacity; + } + + /* 访问元素 */ + get(index) { + // 索引如果越界则抛出异常，下同 + if (index >= this.#size) { + throw new Error('索引越界'); + } + return this.#nums[index]; + } + + /* 更新元素 */ + set(index, num) { + if (index >= this._size) throw new Error('索引越界'); + this.#nums[index] = num; + } + + /* 尾部添加元素 */ + add(num) { + // 如果长度等于容量，则需要扩容 + if (this.#size === this.#capacity) { + this.extendCapacity(); + } + // 将新元素添加到列表尾部 + this.#nums[this.#size] = num; + this.#size++; + } + + /* 中间插入元素 */ + insert(index, num) { + if (index >= this.#size) { + throw new Error('索引越界'); + } + // 元素数量超出容量时，触发扩容机制 + if (this.#size === this.#capacity) { + this.extendCapacity(); + } + // 将索引 index 以及之后的元素都向后移动一位 + for (let j = this.#size - 1; j >= index; j--) { + this.#nums[j + 1] = this.#nums[j]; + } + // 更新元素数量 + this.#nums[index] = num; + this.#size++; + } + + /* 删除元素 */ + remove(index) { + if (index >= this.#size) throw new Error('索引越界'); + let num = this.#nums[index]; + // 将索引 index 之后的元素都向前移动一位 + for (let j = index; j < this.#size - 1; j++) { + this.#nums[j] = this.#nums[j + 1]; + } + // 更新元素数量 + this.#size--; + // 返回被删除元素 + return num; + } + + /* 列表扩容 */ + extendCapacity() { + // 新建一个长度为 size 的数组，并将原数组拷贝到新数组 + this.#nums = this.#nums.concat( + new Array(this.capacity() * (this.#extendRatio - 1)) + ); + // 更新列表容量 + this.#capacity = this.#nums.length; + } + } ``` === "TypeScript" From 3f39a8c3cc4ef49861908dc7df6b4c3dac129b31 Mon Sep 17 00:00:00 2001 From: justin Date: Mon, 12 Dec 2022 21:33:30 +0800 Subject: [PATCH 7/7] Update JavaScript style (Chapter of Array and Linkedlist) --- codes/javascript/chapter_array_and_linkedlist/array.js | 4 ++-- codes/javascript/chapter_array_and_linkedlist/list.js | 6 ------ 2 files changed, 2 insertions(+), 8 deletions(-) diff --git a/codes/javascript/chapter_array_and_linkedlist/array.js b/codes/javascript/chapter_array_and_linkedlist/array.js index edc78d9b4..84b9fc0ff 100644 --- a/codes/javascript/chapter_array_and_linkedlist/array.js +++ b/codes/javascript/chapter_array_and_linkedlist/array.js @@ -14,8 +14,8 @@ function randomAccess(nums) { } /* 扩展数组长度 */ -// 请注意，Python 的 list 是动态数组，可以直接扩展 -// 为了方便学习，本函数将 list 看作是长度不可变的数组 +// 请注意，JavaScript 的 Array 是动态数组，可以直接扩展 +// 为了方便学习，本函数将 Array 看作是长度不可变的数组 function extend(nums, enlarge) { // 初始化一个扩展长度后的数组 const res = new Array(nums.length + enlarge).fill(0); diff --git a/codes/javascript/chapter_array_and_linkedlist/list.js b/codes/javascript/chapter_array_and_linkedlist/list.js index 0ec1cf348..19318337f 100644 --- a/codes/javascript/chapter_array_and_linkedlist/list.js +++ b/codes/javascript/chapter_array_and_linkedlist/list.js @@ -48,12 +48,6 @@ for (const n of list) { count++; } -/* 直接遍历列表元素 */ -count = 0; -for (const n of list) { - count++; -} - /* 拼接两个列表 */ const list1 = [6, 8, 7, 10, 9]; list.push(...list1);