LinearListStack(線性表?xiàng)?
github源碼
特點(diǎn)：
1.從數(shù)據(jù)結(jié)構(gòu)角度看，棧也是線性表，其特殊性在于棧的基本操作是線性表操作的子集，是操作受限的線性表。但是從數(shù)據(jù)類型角度看，棧是和線性表大不相同的兩類抽象數(shù)據(jù)類型。
2.棧（stack）是限定僅在表尾進(jìn)行插入或刪除操作的線性表，因此，對(duì)棧來說，表尾端有其特殊含義，稱為棧頂（top），表頭端稱為棧底（bottom）。
3.棧的修改是按后進(jìn)先出的原則進(jìn)行的，因此，棧又稱為后進(jìn)先出（Last in First out）的線性表（簡稱LIFO結(jié)構(gòu)）。
4.和線性表類似，棧也有兩種存儲(chǔ)表示方法，順序棧和鏈棧。
順序棧，即棧的順序存儲(chǔ)結(jié)構(gòu)是利用一組地址連續(xù)的存儲(chǔ)單元依次存放自棧底到棧頂?shù)臄?shù)據(jù)元素，同時(shí)附設(shè)指針top指示棧頂元素在順序棧中的位置。
5.由于棧在使用過程中所需最大空間的大小很難估計(jì)，因此一般情況下，在初始化設(shè)置空棧時(shí)不應(yīng)限定棧的最大容量。對(duì)于順序棧，一個(gè)較合理的做法是，先為順序棧分配一個(gè)基本容量，然后在應(yīng)用過程中，當(dāng)棧的空間不足夠使用時(shí)再逐步擴(kuò)大。為此，可設(shè)定兩個(gè)常量：STACK_INIT_SIZE(存儲(chǔ)空間初始分配量)和STACKINCREMENT(存儲(chǔ)空間分配增量)。
LinearListStack.c文件
#include <stdio.h>
#include <malloc.h>
#include "LinearListStack.h"
//線性表?xiàng)?
static void clear(LinearListStack *This);
static int isEmpty(LinearListStack *This);
static int length(LinearListStack *This);
static void risePrint(LinearListStack *This);
static void downPrint(LinearListStack *This);
static int getTop(LinearListStack *This,ElemType* e);
static int push(LinearListStack *This,ElemType* e);
static int pop(LinearListStack *This, ElemType* e);
LinearListStack *InitLinearListStack(){
LinearListStack *L = (LinearListStack *)malloc(sizeof(LinearListStack));
LinearListStack_P *p = (LinearListStack_P *)malloc(sizeof(LinearListStack_P));
p->base = (ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType));
p->top = p->base;
p->length = 0; //當(dāng)前長度
p->size = STACK_INIT_SIZE; //當(dāng)前分配量
L->This = p;
L->clear = clear;
L->isEmpty = isEmpty;
L->length = length;
L->risePrint = risePrint;
L->downPrint = downPrint;
L->getTop = getTop;
L->push = push;
L->pop = pop;
return L;
}
void DestroyLinearListStack(LinearListStack *L){
free(L->This);
free(L);
L = NULL;
}
static void clear(LinearListStack *This){
LinearListStack_P *p = This->This;
p->top = p->base;
p->length = 0; //當(dāng)前長度
}
static int isEmpty(LinearListStack *This){
LinearListStack_P *p = This->This;
return (p->length == 0);
}
static int length(LinearListStack *This){
LinearListStack_P *p = This->This;
return p->length;
}
static void risePrint(LinearListStack *This){
LinearListStack_P *p = This->This;
int i;
for (i=0; i < p->length; i++){
printf("%c", *(p->base + i));
}
printf("\n");
}
static void downPrint(LinearListStack *This){
LinearListStack_P *p = This->This;
int i;
for (i=0; i < p->length; i++){
printf("%c", *(p->top - 1 - i));
}
printf("\n");
}
static int getTop(LinearListStack *This,ElemType* e){
LinearListStack_P *p = This->This;
if (p->top == p->base) return -1;
*e = *(p->top-1);
return 0;
}
static int push(LinearListStack *This,ElemType* e){
LinearListStack_P *p = This->This;
if (p->top - p->base >= p->size){ //判斷存儲(chǔ)空間是否夠用
ElemType *newbase = (ElemType *)realloc(p->base, (p->size + STACKINCREMENT)*sizeof(ElemType));
if (!newbase) return -1;//存儲(chǔ)空間分配失敗
p->base = newbase;//新基址
p->top = p->base + p->size;
p->size += STACKINCREMENT;//增加存儲(chǔ)容量
}
*((p->top)++) = *e;
++p->length;
return 0;
}
static int pop(LinearListStack *This, ElemType* e){
LinearListStack_P *p = This->This;
if (p->top == p->base) return -1;
*e = *(p->top-1);
p->top--;
p->length--;
return 0;
}
LinearListStack.h文件
/* Define to prevent recursive inclusion -------------------------------------*/
#ifndef __LINEARLISTSTACK_H
#define __LINEARLISTSTACK_H
/* Includes ------------------------------------------------------------------*/
/* Exported types ------------------------------------------------------------*/
typedef char ElemType;
typedef struct LinearListStack_P{
ElemType *base;
ElemType *top; //棧頂指針
int length; //當(dāng)前線性表?xiàng)５拈L度
int size; //當(dāng)前分配的存儲(chǔ)容量
}LinearListStack_P;
typedef struct LinearListStack{
LinearListStack_P *This;
void (*clear)(struct LinearListStack *This);
int (*isEmpty)(struct LinearListStack *This);
int (*length)(struct LinearListStack *This);
void (*risePrint)(struct LinearListStack *This);
void (*downPrint)(struct LinearListStack *This);
int (*getTop)(struct LinearListStack *This,ElemType* e);
int (*push)(struct LinearListStack *This,ElemType* e);
int (*pop)(struct LinearListStack *This, ElemType* e);
}LinearListStack;
/* Exported define -----------------------------------------------------------*/
#define STACK_INIT_SIZE 100 //線性表?xiàng)４鎯?chǔ)空間的初始分配量
#define STACKINCREMENT 10 //線性表?xiàng)４鎯?chǔ)空間的分配增量(當(dāng)存儲(chǔ)空間不夠時(shí)要用到)
/* Exported macro ------------------------------------------------------------*/
LinearListStack *InitLinearListStack();
void DestroyLinearListStack(LinearListStack *L);
#endif
testLinearListStack.c文件
#include <stdio.h>
#include <malloc.h>
#include "LinearListStack.h"
int strlen(char *str){
int i = 0;
while(*(str+i) != '\0'){
i++;
}
return i;
}
int main(void)
{
int i;
char string[] = "abcdefgh";
int strlength = strlen(string);
ElemType elem;
LinearListStack *stack = InitLinearListStack();
printf("string length = %d\n",strlength);
printf("stack is empty:%d\n",stack->isEmpty(stack));
for (i = 0; i < strlength; i++){
stack->push(stack,string+i);
}
printf("base to top: \n");
stack->risePrint(stack);
printf("top to base: \n");
stack->downPrint(stack);
printf("stack is empty:%d\n",stack->isEmpty(stack));
printf("stack length:%d\n",stack->length(stack));
for(i=0;i < strlength; i++){
stack->getTop(stack,&elem);
printf("get top elem:%c\n",elem);
stack->pop(stack,&elem);
printf("pop elem:%c\n",elem);
}
printf("stack is empty:%d\n",stack->isEmpty(stack));
printf("stack length:%d\n",stack->length(stack));
stack->clear(stack);
DestroyLinearListStack(stack);
return 0;
}
編譯：
gcc LinearListStack.c LinearListStack.h testLinearListStack.c -o testLinearListStack
運(yùn)行testLinearListStack
輸出：
string length = 8
stack is empty:1
base to top:
abcdefgh
top to base:
hgfedcba
stack is empty:0
stack length:8
get top elem:h
pop elem:h
get top elem:g
pop elem:g
get top elem:f
pop elem:f
get top elem:e
pop elem:e
get top elem:d
pop elem:d
get top elem:c
pop elem:c
get top elem:b
pop elem:b
get top elem:a
pop elem:a
stack is empty:1
stack length:0
