学习栈的时候尝试用其他的数据结构实现栈。这篇文章记录的是数组实现栈数据结构,之后还会用链表实现栈数据结构。在写代码的过程发现一个bool数据类型的问题,C语言中实际不存在bool类型,但是在C99标准里面又定义了bool类型变量,只要引入头文件<stdbool.h>, 就能在C语言里面正常使用bool类型的。否则会出现编译问题。
In file included from stack_arr.c:4:
stack_arr.h:18: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Push'
stack_arr.c:19: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Push'
stack_arr.h:18: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Push'
#ifndef STACL_ARR_
#define STACK_ARR_
#include <stdbool.h>
#define false 0
#define true 1
/*定义栈*/
typedef struct stack_arr_
{
char *data;
int count; // 数组下标
int stack_len; //栈大小
}stack_arr;
stack_arr *CreatStackArr(int size);
bool Push(stack_arr *stack, char item);
char Pop(stack_arr *stack);
void display(stack_arr *stack);
#endif
#include <stdio.h>
#include <stdlib.h>
#include "stack_arr.h"
stack_arr * CreatStackArr(int count)
{
stack_arr* st = (stack_arr*) malloc(sizeof(stack_arr));
if(NULL == st){
printf("malloc failed !!!\n");
}
st->data = (char *)malloc(count * sizeof(char));
st->count = 0;
st->stack_len = count;
return st;
}
bool Push(stack_arr * stack, char item)
{
if(stack->count == stack->stack_len){
printf("There are no space ...\n");
return false;
}
stack->data[stack->count] = item;
stack->count += 1;
return true;
}
char Pop(stack_arr *stack)
{
char item;
if(stack->count == 0){
printf("Stack has no elements to pop...\n");
return false;
}
item = stack->data[stack->count-1];
stack->count -= 1;
return item;
}
void display(stack_arr *stack)
{
int i;
if(NULL == stack){
printf("Stack is NULL...\n");
return;
}
for(i = 0; i < stack->count; i++){
printf("stack->data[%d] ---- %d\n", i, stack->data[i]);
}
return;
}
int main()
{
int i;
int rec;
stack_arr *st = CreatStackArr(25);
// Push(st, 'a');
// display(st);
// printf("Pop element is %d\n", Pop(st));
for(i = 0; i < 25; i++){
Push(st, i);
}
display(st);
for(i = 0; i < 25; i++){
rec = Pop(st);
printf("Pop element is %d \n", rec);
}
display(st);
}