根据定义和主函数完成链栈的入栈和出栈程序。结果测试:输入:2 3 4 5 6 7 8 0 输出:8 7 6 5 4 3 2 \n\n#include \"stdio.h\"\n\n#include \"mallo
时间: 2023-04-21 19:03:47 浏览: 65
c.h\"\n\n#define MAXSIZE 100\n\ntypedef struct node{\n int data;\n struct node *next;\n}Node;\n\ntypedef struct stack{\n Node *top;\n int count;\n}Stack;\n\nvoid init(Stack *s){\n s->top = NULL;\n s->count = 0;\n}\n\nint push(Stack *s, int data){\n Node *p = (Node*)malloc(sizeof(Node));\n if(p == NULL){\n return 0;\n }\n p->data = data;\n p->next = s->top;\n s->top = p;\n s->count++;\n return 1;\n}\n\nint pop(Stack *s, int *data){\n if(s->top == NULL){\n return 0;\n }\n Node *p = s->top;\n *data = p->data;\n s->top = p->next;\n free(p);\n s->count--;\n return 1;\n}\n\nint main(){\n Stack s;\n init(&s);\n int data;\n while(scanf(\"%d\", &data) != EOF && data != 0){\n push(&s, data);\n }\n while(pop(&s, &data)){\n printf(\"%d \", data);\n }\n return 0;\n}"
相关推荐
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)