一些源程序.docVIP

单链表： #includestdlib.h #includestdio.h typedef struct Node{ char data; struct Node *next; }SLNode; void print(SLNode *head) { SLNode *p; //打印整个链表 p=head; while(p!=0) { printf(%c ,p-data); p=p-next; } printf(\n); } main() { SLNode *head, *p, *q; int m,i; m = sizeof(SLNode); head = (SLNode *)malloc(m); p=head; for(i=0;i5;i++) { p-data = a+i; p-next = (SLNode *)malloc(m); p=p-next; } p-data =a+5; p-next = 0; print(head); //查找到包含字母c的节点 p=head; while(p-data!=c) p=p-next; q=(SLNode *)malloc(m); q-data=x; q-next = p-next; p-next = q; print(head); p=head; while(p-next-data!=c) p=p-next; q=p-next; p-next = q-next; free(q); print(head); } 堆栈： #include stdio.h typedef struct duizan { int neirong[10]; int top; }duizan; void push(duizan *p, int xin) { p-neirong[p-top] = xin; p-top++; } int pop(duizan *p) { int jieguo; p-top--; jieguo = p-neirong[p-top]; return jieguo; } void chushihua(duizan *p) { p-top = 0; } main() { duizan dalang; int x; //初始化堆栈 dalang.top=0; push(dalang,5); push(dalang,4); push(dalang,7); x = pop(dalang); x = pop(dalang); push(dalang,13); //堆栈中添加一个元素5 dalang.neirong[top]=5; top++; //more dalang.neirong[top]=4; top++; // dalang.neirong[top]=3; top++; //取出一个 top--; x=dalang.neirong[top]; //get top--; x=dalang.neirong[top]; //put dalang.neirong[top]=7; top++; } 堆栈数组实现括号匹配问题： #include stdio.h typedef struct duizan { char neirong[10]; int top; }duizan; void push(duizan *p, char xin) { if( p-top = 10) //已经放满烧饼 { printf(满了，大郎不给放了！); } else { p-neirong[p-top] = xin; p-top++; } } char pop(duizan *p) { int jieguo=0; if(p-top=0) printf(可惜,没了); else { p-top--; jieguo = p-neirong[p-top]; } return jieguo; } char getTop(duizan *p) { int jieguo=0; if(p-top = 0) printf(可惜，没了！); else jieguo = p-neirong[ p-top - 1]; return jieguo; } void chushihua(duizan *p) { p-top = 0; } main() { duizan dalang; char *array=x4], *t; //初始化堆栈 chushihua(dalang); t=arra