栈结构实现脸谱撕脸序列

#include<stdio.h>
#include<stdlib.h>
typedef struct stack {
	char** data;
	int top;
	int size;
}stack;

stack* makestack(int n) {
	stack* s = (stack*)malloc(sizeof(stack));
	s->data = (char**)malloc(sizeof(char*) * n);
	s->top = -1;
	s->size = n;
	return s;
}
int pushstack(stack* s, char* val) {
	if (s == NULL) return 0;
	s->top += 1;
	s->data[s->top] = val;
	return 1;
}
void popprintf(stack* s) {
	if (s == NULL) return;
	for (int i = s->top; i >= 0; i--) {
		printf("%d:%s  \n",i+1, s->data[i]);
	}
	return;
}

int main() {

	stack* s = makestack(7);

	char face[7][6];
	for (int i = 0; i < 7; i++) {
		printf("第%d张脸谱的颜色：", i + 1);
		scanf("%s", face[i]);
	}
	for (int i = 0; i < 7; i++) {
		pushstack(s, face[i]);
	}
	popprintf(s);
	return 0;
}