一、棧的概念與特點(diǎn)

? 一種特殊的線性表，它的插入和刪除運(yùn)算均在同一端進(jìn)行。這一端被稱為棧頂，另一端為棧底，插入稱為進(jìn)棧，刪除稱為出棧。有后進(jìn)先出的性質(zhì)。棧頂top相當(dāng)于順序表中的size，即元素個(gè)數(shù)。關(guān)于順序表可以參考數(shù)據(jù)結(jié)構(gòu)（一）——順序表及實(shí)現(xiàn) 。

?

?

?[注]沒有a[n]這個(gè)元素。n是元素的數(shù)量

二、棧的操作及實(shí)現(xiàn)

1、結(jié)構(gòu)體定義

2、初始化

3、判斷是否為空

4、取得棧頂值

5、入棧操作

6、出棧操作

7、打印棧的內(nèi)容

1、結(jié)構(gòu)體定義

#define LENGTH 100 #include<stdio.h> #include<stdlib.h>typedef char datatype;typedef struct sequence_stack{datatype data[LENGTH];int top; }sequence_stack;

2、初始化

#include"stack.h" void init_sequence_stack(sequence_stack *st){st->top = 0; }

3、判斷是否為空

#include"stack.h" int is_empty_sequence_stack(sequence_stack *st){return (st->top? 0:1); }

4、取得棧頂值

#include"stack.h"datatype get_top(sequence_stack *st){if(st->top == 0){printf("the stack is empty!\n");exit(1);}else{return st->data[st->top-1];} }

5、入棧操作

#include"stack.h"void push(sequence_stack *st,datatype x){if(st->top == LENGTH){printf("the stack is full!\n");exit(1);}else{st->data[st->top] = x;st->top++;} }

6、出棧操作

#include"stack.h"datatype pop(sequence_stack *st){if(st->top==0){printf("the stack is empty!\n");exit(1);}else{st->top--;return st->data[st->top];} }

7、打印棧的內(nèi)容

#include"stack.h"void display_sequcence_stack(sequence_stack *st){if(st->top == 0){printf("the stack is empty!\n");exit(1);}else{int i;for(i = 0;i<st->top;i++){printf("%c ",st->data[i]);}} }

?

三、棧的應(yīng)用舉例

括號(hào)匹配：檢驗(yàn)表達(dá)式中的括號(hào)是否匹配

#include<stdio.h> #include"stack.h"void compare(sequence_stack *,datatype);int main(){datatype data='\0';printf("Please input the express: ");sequence_stack Mystack;sequence_stack *stack=&Mystack;init_sequence_stack(stack);while((data=getchar()) != '\n'){switch(data){case '{':case '[':case '(':push(stack,data);break;case '}':compare(stack,'{');break;case ']':compare(stack,'[');break;case ')':compare(stack,'(');break;defult : break;}}if(is_empty_sequence_stack(stack)){printf("The bracket compare!\n");}else {printf("The bracket doesn't compare!\n");}return 0; } void compare(sequence_stack *stack,datatype data){if(get_top(stack) != data){printf("The bracket doesn't compare!\n");exit(0);}else pop(stack); }

?調(diào)試運(yùn)行：

[fsy@localhost stack]$ gcc `ls stack*` bracket_match.c -o bracket_match -g [fsy@localhost stack]$ ./bracket_match Please input the express: abc{1[2(3)]4}aaa The bracket compare! [fsy@localhost stack]$ ./bracket_match Please input the express: {s(s{}s]s} The bracket doesn't compare! [fsy@localhost stack]$ ./bracket_match Please input the express: { [ ( ] ) } The bracket doesn't compare! [fsy@localhost stack]$

?

?本篇博客出自? 阿修羅道，轉(zhuǎn)載請(qǐng)注明出處:?http://blog.csdn.net/fansongy/article/details/6784919

?

?

總結(jié)

以上是生活随笔為你收集整理的数据结构（二）——栈及实现、括号匹配的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。