PTA 6-2 在一个数组中实现两个堆栈

记录 共享栈 问题 中国民航大学 PTA 数据结构作业题

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include<string.h>
#define ERROR 1e8
typedef int ElementType;
typedef enum { push, pop, end } Operation;
typedef int Position;

struct SNode {
    ElementType *Data;
    Position Top1, Top2;
    int MaxSize;
};
typedef struct SNode *Stack;

Stack CreateStack( int MaxSize );
bool Push( Stack S, ElementType X, int Tag );
ElementType Pop( Stack S, int Tag );

Operation GetOp();  /* details omitted */
void PrintStack( Stack S, int Tag ); /* details omitted */

int main()
{
    int N, Tag, X;
    Stack S;
    int done = 0;
    scanf("%d", &N);
    S = CreateStack(N);
    while ( !done ) {
        switch( GetOp() ) {
        case push: 
            scanf("%d %d", &Tag, &X);
            if (!Push(S, X, Tag)) printf("Stack %d is Full!\n", Tag);
            break;
        case pop:
            scanf("%d", &Tag);
            X = Pop(S, Tag);
            if ( X==ERROR ) printf("Stack %d is Empty!\n", Tag);
            break;
        case end:
            PrintStack(S, 1);
            PrintStack(S, 2);
            done = 1;
            break;
        }
    }
    return 0;
}

/* 你的代码将被嵌在这里 */
Stack CreateStack( int MaxSize ){
	Stack S=(Stack)malloc(sizeof(struct SNode));
	if(!S)return false;
	S->Top1=-1;
	S->Top2=MaxSize;
	S->MaxSize=MaxSize;
	S->Data = (int *)malloc(sizeof(int)*MaxSize);
	return S; 
}

bool Push( Stack S, ElementType X, int Tag ){
	if(S->Top1+1==S->Top2){
		printf("Stack Full\n");
		return false;
	}
	else{
	switch(Tag){
		case 1:
			S->Data[++(S->Top1)] = X;
			break;
		case 2:
			S->Data[--(S->Top2)] = X;
			break;
		default:
		return false;
		}
	}
	return true;
}

ElementType Pop( Stack S, int Tag ){
	int e;
	if(Tag == 1){
		if(S->Top1 == -1){
			printf("Stack 1 Empty\n");
			return 1e8;
		}
		else{
			e = S->Data[S->Top1--];
			return e;
		}
	}
	if(Tag == 2){
		if(S->Top2 == S->MaxSize){
			printf("Stack 2 Empty\n");
			return 1e8;	
		}
		else{
			e = S->Data[S->Top2++];
			return e;
		}
	}
}

Operation GetOp(){  /* details omitted */
	char c[10];
	scanf("%s",c);
	if(!strcmp("Push",c)) return push;
	if(!strcmp("Pop",c)) return pop;
	if(!strcmp("End",c)) return end;
}

void PrintStack( Stack S, int Tag ){
	if(Tag == 1){
		printf("Pop from Stack 1:");
		for(S->Top1;S->Top1 > -1;S->Top1--){
			printf("%d ",S->Data[S->Top1]);
		}
	}
	else if(Tag == 2){
		printf("Pop from Stack 2:");
		for(S->Top2;S->Top2 < S->MaxSize;S->Top2++){
			printf("%d ",S->Data[S->Top2]);
		}
	}
} 

对于初学者建议吃透原理 了解栈顶指针是如何工作的 建议看一下经典教材严蔚敏老师数据结构