algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the book based on the revised second edition (#1014)

Browse Source 
* Revised the book

* Update the book with the second revised edition

* Revise base on the manuscript of the first edition
This commit is contained in:
Yudong Jin
2023-12-28 18:06:09 +08:00
committed by GitHub
parent 19dde675df
commit f68bbb0d59
261 changed files with 643 additions and 647 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/csharp/chapter_stack_and_queue/array_deque.cs
View File

@ -48,7 +48,7 @@ public class ArrayDeque {
return;
}
// 队首指针向左移动一位
// 通过取余操作，实现 front 越过数组头部后回到尾部
// 通过取余操作实现 front 越过数组头部后回到尾部
front = Index(front - 1);
// 将 num 添加至队首
nums[front] = num;
@ -61,7 +61,7 @@ public class ArrayDeque {
Console.WriteLine("双向队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 计算队尾指针，指向队尾索引 + 1
int rear = Index(front + queSize);
// 将 num 添加至队尾
nums[rear] = num;

6
codes/csharp/chapter_stack_and_queue/array_queue.cs
View File

@ -38,8 +38,8 @@ class ArrayQueue {
Console.WriteLine("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
// 计算队尾指针，指向队尾索引 + 1
// 通过取余操作实现 rear 越过数组尾部后回到头部
int rear = (front + queSize) % Capacity();
// 将 num 添加至队尾
nums[rear] = num;
@ -49,7 +49,7 @@ class ArrayQueue {
/* 出队 */
public int Pop() {
int num = Peek();
// 队首指针向后移动一位，若越过尾部则返回到数组头部
// 队首指针向后移动一位，若越过尾部，则返回到数组头部
front = (front + 1) % Capacity();
queSize--;
return num;

2
codes/csharp/chapter_stack_and_queue/linkedlist_queue.cs
View File

@ -28,7 +28,7 @@ class LinkedListQueue {
/* 入队 */
public void Push(int num) {
// 尾节点后添加 num
// 在尾节点后添加 num
ListNode node = new(num);
// 如果队列为空，则令头、尾节点都指向该节点
if (front == null) {