数据结构（二） -- 栈 数组实现

栈的描述

栈接口定义

int initStack(stackT *stack, int size);                 /* 初始化栈，大小为size*/
void destoryStack(stackT *stack);                       /* 销毁栈 */
int stackIsEmpty(stackT *stack);                        /* 栈是否为空 */
int stackPush(stackT *stack, stackElementT element);    /* 入栈 */
int stackPop(stackT *stack, stackElementT *element);    /* 出栈 */

栈实现

#ifndef __STACK_H__
#define __STACK_H__

typedef int stackElementT;
typedef struct stack {
int top;
int size;
stackElementT *contents;
}stackT;

int initStack(stackT *stack, int size);                 /* 初始化栈，大小为size*/
void destoryStack(stackT *stack);                       /* 销毁栈 */
int stackIsEmpty(stackT *stack);                        /* 栈是否为空 */
int stackPush(stackT *stack, stackElementT element);    /* 入栈 */
int stackPop(stackT *stack, stackElementT *element);    /* 出栈 */
#endif

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "stack.h"

int initStack(stackT *stack, int size)
{
stack->contents = (stackElementT *)malloc(sizeof(stackElementT) * size);
if(NULL == stack->contents) {
perror("malloc");
return -1;
}
stack->top = -1;
stack->size = size;

return 0;
}

void destoryStack(stackT *stack)
{
free(stack->contents);
stack->contents = NULL;
}

int stackIsEmpty(stackT *stack)
{
if(-1 == stack->top) {
return 1;
} else {
return 0;
}
}

int stackPush(stackT *stack, stackElementT element)
{
if(stack->top == stack->size - 1) {
printf("stack is full.\n");
return -1;
}

stack->top++;
stack->contents[stack->top] = element;

return 0;
}

int stackPop(stackT *stack, stackElementT *element)
{
if(stackIsEmpty(stack)) {
printf("stack is empty.\n");
return -1;
}

*element = stack->contents[stack->top];
stack->top--;

return 0;
}