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

Replace poll with pop

Browse Source
This commit is contained in:
krahets
2023-03-13 22:39:45 +08:00
parent 28aacccf44
commit 516cb17775
6 changed files with 27 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -97,7 +97,7 @@ int peekLast(ArrayDeque *deque) {
}
/* 队首出队 */
int pollFirst(ArrayDeque *deque) {
int popFirst(ArrayDeque *deque) {
int num = peekFirst(deque);
// 队首指针向后移动一位
deque->front = dequeIndex(deque, deque->front + 1);
@@ -106,7 +106,7 @@ int pollFirst(ArrayDeque *deque) {
}
/* 队尾出队 */
int pollLast(ArrayDeque *deque) {
int popLast(ArrayDeque *deque) {
int num = peekLast(deque);
deque->queSize--;
return num;
@@ -149,11 +149,11 @@ int main() {
printArrayDeque(deque);
/* 元素出队 */
int pollLastNum = pollLast(deque);
printf("队尾出队元素 = %d，队尾出队后 deque= ", pollLastNum);
int popLastNum = popLast(deque);
printf("队尾出队元素 = %d，队尾出队后 deque= ", popLastNum);
printArrayDeque(deque);
int pollFirstNum = pollFirst(deque);
printf("队首出队元素 = %d，队首出队后 deque= ", pollFirstNum);
int popFirstNum = popFirst(deque);
printf("队首出队元素 = %d，队首出队后 deque= ", popFirstNum);
printArrayDeque(deque);
/* 获取队列的长度 */

6
codes/c/chapter_stack_and_queue/linkedlist_queue.c
View File

@@ -68,7 +68,7 @@ int peek(LinkedListQueue *queue) {
}
/* 出队 */
void poll(LinkedListQueue *queue) {
void pop(LinkedListQueue *queue) {
int num = peek(queue);
ListNode *tmp = queue->front;
queue->front = queue->front->next;
@@ -108,8 +108,8 @@ int main() {
printf("队首元素 peek = %d\r\n", peekNum);
/* 元素出队 */
poll(queue);
printf("出队元素 poll = %d，出队后 queue = ", peekNum);
pop(queue);
printf("出队元素 pop = %d，出队后 queue = ", peekNum);
printLinkedListQueue(queue);
/* 获取队列的长度 */