xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 00:26:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix bug before commit 5eae708 (#325)

Browse source 
* Fix bug before commit 5eae708

* Update queue.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Justin Tse 2023-02-04 21:26:14 +08:00 committed by GitHub
parent ea6a43b2b9
commit 62114ce79a
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
3 changed files with 18 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
codes/javascript/chapter_stack_and_queue/array_queue.js
View file

@ -31,8 +31,10 @@ class ArrayQueue {
/* 入队 */
push(num) {
if (this.size == this.capacity)
throw new Error("队列已满");
if (this.size == this.capacity) {
console.log("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
const rear = (this.#front + this.size) % this.capacity;

8
codes/typescript/chapter_stack_and_queue/array_queue.ts
View file

@ -11,7 +11,7 @@ class ArrayQueue {
private queSize: number; // 队列长度
constructor(capacity: number) {
this.nums = new Array<number>(capacity);
this.nums = new Array(capacity);
this.front = this.queSize = 0;
}
@ -32,8 +32,10 @@ class ArrayQueue {
/* 入队 */
push(num: number): void {
if (this.size == this.capacity)
throw new Error("队列已满");
if (this.size == this.capacity) {
console.log("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
const rear = (this.front + this.queSize) % this.capacity;

14
docs/chapter_stack_and_queue/queue.md
View file

@ -1027,8 +1027,10 @@ comments: true
/* 入队 */
push(num) {
if (this.size == this.capacity)
throw new Error("队列已满");
if (this.size == this.capacity) {
console.log("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
const rear = (this.#front + this.size) % this.capacity;
@ -1065,7 +1067,7 @@ comments: true
private queSize: number; // 队列长度
constructor(capacity: number) {
this.nums = new Array<number>(capacity);
this.nums = new Array(capacity);
this.front = this.queSize = 0;
}
@ -1086,8 +1088,10 @@ comments: true
/* 入队 */
push(num: number): void {
if (this.size == this.capacity)
throw new Error("队列已满");
if (this.size == this.capacity) {
console.log("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
const rear = (this.front + this.queSize) % this.capacity;