12345

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 10
typedef struct {
int data[MAXSIZE];
int top1;
int top2;
} DoubleStack;
void InitStack(DoubleStack* s) {
s->top1 = -1;
s->top2 = MAXSIZE;
}
int IsFull(DoubleStack* s) {
return (s->top1 + 1 == s->top2 - 1);
}
int Push(DoubleStack* s, int x) {
if (IsFull(s)) {
printf("Stack is full!\n");
return -1;
}
if (x % 2 == 0) { // 偶数
s->top1++;
s->data[s->top1] = x;
} else { // 奇数
s->top2--;
s->data[s->top2] = x;
}
return 0;
}
int Pop(DoubleStack* s, int* x) {
if (s->top1 == -1 && s->top2 == MAXSIZE) {
printf("Stack is empty!\n");
return -1;
}
if (s->top1 >= 0) { // 从偶数那头出栈
*x = s->data[s->top1];
s->top1--;
} else { // 从奇数那头出栈
*x = s->data[s->top2];
s->top2++;
}
return 0;
}
int main() {
DoubleStack s;
int x;
InitStack(&s);
while (scanf("%d", &x) != EOF) {
Push(&s, x);
if (IsFull(&s)) {
break;
}
}
printf("From the smaller end:\n");
while (!IsFull(&s)) {
Pop(&s, &x);
printf("%d ", x);
}
printf("\nFrom the larger end:\n");
while (!IsFull(&s)) {
Pop(&s, &x);
printf("%d ", x);
}
return 0;
}

感谢各位大佬的帮助