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

A bug fix.

Browse Source
This commit is contained in:
krahets
2023-12-19 21:55:57 +08:00
parent d9686e57dd
commit 9a5ab776d6
9 changed files with 30 additions and 34 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/c/chapter_stack_and_queue/array_stack.c
View File

@ -42,7 +42,7 @@ bool isEmpty(ArrayStack *stack) {
/* 入栈 */
void push(ArrayStack *stack, int num) {
if (stack->size == MAX_SIZE) {
printf("stack is full.\n");
printf("栈已满\n");
return;
}
stack->data[stack->size] = num;
@ -52,7 +52,7 @@ void push(ArrayStack *stack, int num) {
/* 访问栈顶元素 */
int peek(ArrayStack *stack) {
if (stack->size == 0) {
printf("stack is empty.\n");
printf("栈为空\n");
return INT_MAX;
}
return stack->data[stack->size - 1];
@ -60,10 +60,6 @@ int peek(ArrayStack *stack) {
/* 出栈 */
int pop(ArrayStack *stack) {
if (stack->size == 0) {
printf("stack is empty.\n");
return INT_MAX;
}
int val = peek(stack);
stack->size--;
return val;