03栈的基本操作之括号匹配,进制转换（03, the basic operation of the stack bracket matching, hexadecimal conversion）.docVIP

03栈的基本操作之括号匹配,进制转换（03, the basic operation of the stack bracket matching, hexadecimal conversion） 括号匹配 # includes stdio.h # includes string.h # includes stdlib.h # define mixsize 100 # define stackincrement 100 typedef char datatype; typedef struct { datatype date [mixsize]; int top; seqstack}; / / 定义结构体 / / 初始化 void stackinitiate (seqstack * s) { s - top = 0; } / / 判断是否为空 int stacknotempty (seqstack d) { if (s.top = 0) return 0; else return 1; } / / 入栈 int stackpush (seqstack * s, datatype x) { if (s - = mixsize) { printf (栈满, 无法输入 \ n); return 0;} else { s - date [s - top] = x; s - top + +; return 1; } } / / 出栈 int stackpop (seqstack * s, datatype * d) { if (s - = 0) { printf (栈空 \ n); return 0; } else { s - top -. * d = s - (s - [top]; return 1; } } int stacktop (seqstack s, datatype * d) / / 取栈顶元素.若栈s非空, 则返回栈顶元素, 但不改变栈的状态. { if (s.top = 0) {printf (栈已空! \ n); return 0; } else { * d = s.data [s.top-1]; return 1; } } / / 括号匹配算法 void kuohaopipei (char [mixsize]) / / 判断有n个字符的的字符串a左、右括号是否配对正确 { seqstack mystack; int i; char c; stackinitiate ( mystack); for (i = 0; [i]. = \ 0; i + +) { if (a [i] = = = () | | (a [i] = = [) | | (a [i] = = 0) stackpush ( mystack, []); / / 入栈 else if (a [i] = =) stacknotempty (mystack) stacktop (mystack, c) c = = () stackpop ( mystack, c). else if (a [i] = =) stacknotempty (mystack) stacktop (mystack, c) c! = () { printf (此串括号匹配不合法! \ n); return; } else if (a [i] = = =] stacknotempty (mystack) stacktop (mystack, c) c = = ) stackpop ( mystack, c). else if (a [i] = = =] stacknotempty (mystack) stacktop (mystack, c) c! = = [ { printf (此串括号匹配不合法! \ n); return; } else if (a [i] = = 1) | | (a [i] = =)) ! stacknotempty (mystack)) { printf (此串括号匹配不合法! \ n); return; } if (a [i] = =} stacknotempty (mystack) stacktop (mystack, c) c = = {) stackpop ( mystack, c). else if (a [i] = =} stacknotempty (mystack) stacktop (mystack, c) c! =}) { printf (此串括号匹配不合法! \ n); return; } } if (stacknote