stack.h

来自「这个是简单的初级的算法代码汗 不要在冒了」· C头文件 代码 · 共 108 行

#define HEAD struct stackhead
#define NODE struct stacknode

void createStack(HEAD *);
int pushStack(HEAD *, int );
int popStack(HEAD *, int *);
int stackTop(HEAD *, int *);
int emptyStack(HEAD *);
int fullStack(HEAD *);
int stackCount(HEAD *);
void destroyStack(HEAD *);

HEAD
{
int count;
NODE *top;
};
NODE
{
int data;
NODE *next;
};

void createStack(HEAD *stack)
{
stack->count = 0;
stack->top = NULL;
}

int fullStack(HEAD *stack)
{
NODE *temp;
int result;
temp = (NODE *)malloc(sizeof(NODE));
if (temp == NULL)
        result = 1;
else
        {
        free(temp);
        result = 0;
        }
return result;
}

int pushStack(HEAD *stack, int dataIn)
{
int success;
if (fullStack(stack))
        {
        printf("Overflow");
        success = 0;
        }
else
        {
        NODE *pNew;
        pNew = (NODE *)malloc(sizeof(NODE));
        pNew->data = dataIn;
        pNew->next = stack->top;
        stack->top = pNew;
        stack->count ++;
        success = 1;
        }
return success;
}

int emptyStack(HEAD *stack)
{
return(stack->count == 0);
}

int popStack(HEAD *stack, int *dataOut)
{
int success;
if (emptyStack(stack))
        {
        printf("Underflow");
        success = 0;
        }
else
        {
        NODE *pPop;
        pPop = stack->top;
        *dataOut = stack->top->data;
        stack->top = stack->top->next;
        stack->count --;
        free(pPop);
        success = 1;
        }
return success;
}

int stackTop(HEAD *stack, int *dataOut)
{
int success;
if (emptyStack(stack))
        {
        printf("Underflow");
        success = 0;
        }
else
        {
        *dataOut = stack->top->data;
        success = 1;
        }
return success;
}