用C++写一个通过递归颠倒一个栈
时间: 2024-06-06 13:07:47 浏览: 2
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 100
typedef struct stack {
int data[MAX_SIZE];
int top;
} Stack;
Stack *createStack() {
Stack *s = (Stack *)malloc(sizeof(Stack));
s->top = -1;
return s;
}
int isFull(Stack *s) {
return s->top == MAX_SIZE - 1;
}
int isEmpty(Stack *s) {
return s->top == -1;
}
void push(Stack *s, int x) {
if (isFull(s)) {
printf("Error: Stack is full\n");
return;
}
s->data[++s->top] = x;
}
int pop(Stack *s) {
if (isEmpty(s)) {
printf("Error: Stack is empty\n");
return -1;
}
return s->data[s->top--];
}
void printStack(Stack *s) {
printf("Stack: ");
for (int i = 0; i <= s->top; i++) {
printf("%d ", s->data[i]);
}
printf("\n");
}
void reverse(Stack *s) {
if (isEmpty(s)) {
return;
}
int x = pop(s);
reverse(s);
push(s, x);
}
int main() {
Stack *s = createStack();
push(s, 1);
push(s, 2);
push(s, 3);
push(s, 4);
push(s, 5);
printf("Before reverse:\n");
printStack(s);
reverse(s);
printf("After reverse:\n");
printStack(s);
return 0;
}
相关推荐
![pdf](https://img-home.csdnimg.cn/images/20210720083512.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)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)