#define ARRAY_STACK 1
#ifdef ARRAY_STACK
/* 数据域结构 */
typedef struct _StackNode {
int data;
} StackNode;
typedef struct {
int top; /* 栈顶位置 */
int maxSize; /* 栈中最多存放的元素 */
StackNode *arrayStack; /* 栈元素数组 */
} ArrayStack;
typedef ArrayStack Stack;
/***********栈的操作*************/
void StackInit(Stack *stack, unsigned int size); /* 初始化一个栈 */
bool StackPush(Stack *stack, const StackNode *stackNode); /* 元素压栈 */
bool StackPop(Stack *stack, StackNode *stackNode); /* 删除栈顶元素 */
bool StackTop(Stack *stack, StackNode *stackNode); /* 返回栈顶元素 */
void StackFree(Stack *stack); /* 清空栈 */
/* 初始化一个栈 */
void StackInit(Stack *stack, unsigned int size)
{
stack->maxSize = size;
stack->top = -1;
if (size != 0) {
stack->arrayStack = (StackNode *)malloc(sizeof(StackNode) * size);
if (stack->arrayStack == NULL) {
printf("stack malloc error");
return;
}
memset(stack->arrayStack, 0, sizeof(StackNode) * size);
}
return;
}
/* 释放栈 */
void StackFree(Stack *stack)
{
if (stack != NULL) {
free(stack->arrayStack);
}
return;
}
/* 判断栈是否为空 */
bool StackIsEmpty(Stack *stack)
{
if (stack == NULL || stack->top < 0) {
return true;
}
return false;
}
#define ADD_CAPACITY 10
/* 栈空间动态扩展 */
static bool StackMallocNew(Stack *stack)
{
StackNode *newStack = NULL;
newStack = (StackNode *)malloc(sizeof(StackNode) * (stack->maxSize + ADD_CAPACITY));
if (newStack == NULL) {
return false;
}
memset(newStack, 0, sizeof(StackNode) * (stack->maxSize + ADD_CAPACITY));
memcmp(newStack, stack->arrayStack, sizeof(StackNode) * stack->maxSize);
free(stack->arrayStack);
stack->arrayStack = newStack;
stack->maxSize = stack->maxSize + 10;
return true;
}
/* 元素压栈 */
bool StackPush(Stack *stack, const StackNode *stackNode)
{
if (stack == NULL || stackNode == NULL) {
return false;
}
if (stack->top == stack->maxSize - 1) {
printf("is full stack,alloc new");
/* 可以动态扩充栈的大小 */
if (StackMallocNew(stack) != true) {
return false;
}
}
stack->top++;
stack->arrayStack[stack->top].data = stackNode->data;
return true;
}
/* 删除栈顶元素 */
bool StackPop(Stack *stack, StackNode *stackNode)
{
StackNode *result = NULL;
if (stack == NULL || stackNode == NULL) {
return false;
}
/* 空栈 */
if (StackIsEmpty(stack) == true) {
return false;
}
stackNode->data = stack->arrayStack[stack->top].data;
stack->top--;
return true;
}
/* 返回栈顶元素 */
bool StackTop(Stack *stack, StackNode *stackNode)
{
StackNode *result = NULL;
if (stack == NULL || stackNode == NULL) {
return false;
}
/* 空栈 */
if (StackIsEmpty(stack) == true) {
return false;
}
stackNode->data = stack->arrayStack[stack->top].data;
return true;
}
#endif