CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 11:41:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-04-17 21:57:42 +08:00
parent b472215f0e
commit cf4a59e3d6
20 changed files with 247 additions and 198 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
chapter_array_and_linkedlist/linked_list.md
View File

@@ -522,8 +522,7 @@ comments: true
```javascript title="linked_list.js"
/* 删除链表的节点 n0 之后的首个节点 */
function remove(n0) {
if (!n0.next)
return;
if (!n0.next) return;
// n0 -> P -> n1
const P = n0.next;
const n1 = P.next;

27
chapter_array_and_linkedlist/list.md
View File

@@ -1143,15 +1143,13 @@ comments: true
/* 访问元素 */
get(index) {
// 索引如果越界则抛出异常，下同
if (index < 0 || index >= this.#size)
throw new Error('索引越界');
if (index < 0 || index >= this.#size) throw new Error('索引越界');
return this.#nums[index];
}
/* 更新元素 */
set(index, num) {
if (index < 0 || index >= this.#size)
throw new Error('索引越界');
if (index < 0 || index >= this.#size) throw new Error('索引越界');
this.#nums[index] = num;
}
@@ -1168,8 +1166,7 @@ comments: true
/* 中间插入元素 */
insert(index, num) {
if (index < 0 || index >= this.#size)
throw new Error('索引越界');
if (index < 0 || index >= this.#size) throw new Error('索引越界');
// 元素数量超出容量时，触发扩容机制
if (this.#size === this.#capacity) {
this.extendCapacity();
@@ -1185,8 +1182,7 @@ comments: true
/* 删除元素 */
remove(index) {
if (index < 0 || index >= this.#size)
throw new Error('索引越界');
if (index < 0 || index >= this.#size) throw new Error('索引越界');
let num = this.#nums[index];
// 将索引 index 之后的元素都向前移动一位
for (let j = index; j < this.#size - 1; j++) {
@@ -1249,23 +1245,20 @@ comments: true
/* 访问元素 */
public get(index: number): number {
// 索引如果越界则抛出异常，下同
if (index < 0 || index >= this._size)
throw new Error('索引越界');
if (index < 0 || index >= this._size) throw new Error('索引越界');
return this.nums[index];
}
/* 更新元素 */
public set(index: number, num: number): void {
if (index < 0 || index >= this._size)
throw new Error('索引越界');
if (index < 0 || index >= this._size) throw new Error('索引越界');
this.nums[index] = num;
}
/* 尾部添加元素 */
public add(num: number): void {
// 如果长度等于容量，则需要扩容
if (this._size === this._capacity)
this.extendCapacity();
if (this._size === this._capacity) this.extendCapacity();
// 将新元素添加到列表尾部
this.nums[this._size] = num;
this._size++;
@@ -1273,8 +1266,7 @@ comments: true
/* 中间插入元素 */
public insert(index: number, num: number): void {
if (index < 0 || index >= this._size)
throw new Error('索引越界');
if (index < 0 || index >= this._size) throw new Error('索引越界');
// 元素数量超出容量时，触发扩容机制
if (this._size === this._capacity) {
this.extendCapacity();
@@ -1290,8 +1282,7 @@ comments: true
/* 删除元素 */
public remove(index: number): number {
if (index < 0 || index >= this._size)
throw new Error('索引越界');
if (index < 0 || index >= this._size) throw new Error('索引越界');
let num = this.nums[index];
// 将索引 index 之后的元素都向前移动一位
for (let j = index; j < this._size - 1; j++) {