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

refactor: Replace poll with pop in Queue and Deque (#415)

Browse Source
This commit is contained in:
Yudong Jin
2023-03-13 21:58:21 +08:00
committed by GitHub
parent 2d17ee8e92
commit 8aebbaad21
77 changed files with 261 additions and 261 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/cpp/chapter_stack_and_queue/array_deque.cpp
View File

@ -72,7 +72,7 @@ public:
}
/* 队首出队 */
int pollFirst() {
int popFirst() {
int num = peekFirst();
// 队首指针向后移动一位
front = index(front + 1);
@ -81,7 +81,7 @@ public:
}
/* 队尾出队 */
int pollLast() {
int popLast() {
int num = peekLast();
queSize--;
return num;
@ -139,11 +139,11 @@ int main() {
PrintUtil::printVector(deque->toVector());
/* 元素出队 */
int pollLast = deque->pollLast();
cout << "队尾出队元素 = " << pollLast << "，队尾出队后 deque = ";
int popLast = deque->popLast();
cout << "队尾出队元素 = " << popLast << "，队尾出队后 deque = ";
PrintUtil::printVector(deque->toVector());
int pollFirst = deque->pollFirst();
cout << "队首出队元素 = " << pollFirst << "，队首出队后 deque = ";
int popFirst = deque->popFirst();
cout << "队首出队元素 = " << popFirst << "，队首出队后 deque = ";
PrintUtil::printVector(deque->toVector());
/* 获取双向队列的长度 */