用数组实现栈操作

大家好！我是编码小哥，欢迎关注，持续分享更多实用的编程经验和开发技巧，共同进步！

源码：

#include <stdio.h>

void push();
void pop();
void peek();
void update();

int a[100], top = -1;

int main()
{
    int x;
    while (1)
    {
        printf("\n0.exit");
        printf("\n1.push");
        printf("\n2.pop");
        printf("\n3.peek");
        printf("\n4.update");
        printf("\nenter your choice? ");
        scanf("%d", &x);
        switch (x)
        {
        case 0:
            return 0;
        case 1:
            push();
            break;
        case 2:
            pop();
            break;
        case 3:
            peek();
            break;
        case 4:
            update();
            break;
        default:
            printf("\ninvalid choice");
        }
    }
    return (0);
}

//压栈
void push()
{
    int n = 0;
    printf("\nenter the value to insert? ");
    scanf("%d", &n);
    top += 1;
    a[top] = n;
}

//出栈
void pop()
{
    if (top == -1)
    {
        printf("\nstack is empty");
    }
    else
    {
        int item;
        item = a[top];
        top -= 1;
        printf("\npoped item is %d ", item);
    }
}

//打印栈顶元素
void peek()
{
    if (top >= 0)
        printf("\n the top element is %d", a[top]);
    else
        printf("\nstack is empty");
}

//更新栈中的元素
void update()
{
    int i, n;
    printf("\nenter the position to update? ");
    scanf("%d", &i);
    printf("\nenter the item to insert? ");
    scanf("%d", &n);
    if (top - i + 1 < 0)
    {
        printf("\nunderflow condition");
    }
    else
    {
        a[top - i + 1] = n;
    }
}

运行结果：

0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 1

enter the value to insert? 000

0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 1

enter the value to insert? 111

0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 1

enter the value to insert? 222

0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 4

enter the position to update? 1

enter the item to insert? 333

0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 3

 the top element is 333
0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 2

poped item is 333 
0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 2

poped item is 111 
0.exit
1.push
2.pop
3.peek
4.update
enter your choice? 2

poped item is 0 
0.exit
1.push
2.pop
3.peek
4.update
enter your choice?

注：

元素            待更新的元素位置

栈顶                          1

......                        ......

......                        ......

栈底                        n