mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-04 19:20:52 +08:00
Update the book based on the revised second edition (#1014)
* 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:
@@ -49,7 +49,7 @@ func (q *arrayDeque) pushFirst(num int) {
|
||||
return
|
||||
}
|
||||
// 队首指针向左移动一位
|
||||
// 通过取余操作,实现 front 越过数组头部后回到尾部
|
||||
// 通过取余操作实现 front 越过数组头部后回到尾部
|
||||
q.front = q.index(q.front - 1)
|
||||
// 将 num 添加至队首
|
||||
q.nums[q.front] = num
|
||||
@@ -62,7 +62,7 @@ func (q *arrayDeque) pushLast(num int) {
|
||||
fmt.Println("双向队列已满")
|
||||
return
|
||||
}
|
||||
// 计算尾指针,指向队尾索引 + 1
|
||||
// 计算队尾指针,指向队尾索引 + 1
|
||||
rear := q.index(q.front + q.queSize)
|
||||
// 将 num 添加至队首
|
||||
q.nums[rear] = num
|
||||
|
||||
Reference in New Issue
Block a user