C++链表、栈、队列用法示例.doc

??? C++链表操作示例 *#29·链表创建struct ts *Create(){struct ts *head=NULL,*tail=NULL,*newnode;//首节点newnode=new ts;strcpy(newnode-name,张三);strcpy(newnode-num;head=newnode;tail=newnode;tail-next=NULL;//第二个newnode=new ts;strcpy(newnode-name,李四);strcpy(newnode-num;tail-next =newnode;tail=newnode;tail-next=NULL;return head;}//初始化*#30·链表输出//显示所有信息void display(ts *head){ts *p=head;if(head==NULL)//链表为空{cout链表为空！endl;return ;}cout链表内容如下：endl;while(p!=NULL){coutp-name\tp-num \tendl;p=p-next;}}//display*#31·插入节点//开头插入节点void add(ts *head,ts *neod){struct ts *tail=NULL;if(head==NULL){head=neod;tail=neod;tail-next=NULL;}else{neod-next =head;head=neod;}}//插入节点//结尾插入节点void inst(ts *head,ts *neod){struct ts *tail=NULL,*p=head;if(head==NULL){head=neod;tail=neod;tail-next=NULL;}else{while(p-next!=NULL){p=p-next;}p-next=neod;neod-next=NULL;}}//插入节点*#32·链表删除//删除功能void del(ts *head,char c[]){ts *p=head;//首节点if(strcmp(c,p-name)==0){head=p-next;//p=head;}//ifelse{while(p!=NULL){if(strcmp(c,p-next-name)==0){ts *q;q=p-next;p-next=q-next;break;}//ifp=p-next;}//while}//else;}//del//删除头结点void delh(ts *head){if(head==NULL)return;elsehead=head-next;//p=head;}//delh//删除尾结点void delt(ts *head){struct ts *tail=NULL,*p=head;if(head==NULL)return;else{while(p-next-next!=NULL)p=p-next;p-next=NULL; }}//delt*#33·链表查找//查找by indexstruct ts *serch(ts *head,int r){struct ts *p=head;int j=1;if(r0)cout编号错误endl;else{while(j!=rp!=NULL){j++;p=p-next;}if(r==jp!=NULL)return p;else{cout编号错误endl;return head;}}}//serch*#34·数组函数#include iostream.h#include stdlib.h#include time.hstruct test{int x;//操作数1int y;//操作数2 int z;//答案};//创建void cre(int a[][10],int line)//数组，总数，范围上届{int i=0,j=0;srand(time(NULL));//时间种子for(i=0;iline;i++){for(j=0;j10;j++){a[i][j] =int(rand()%(100-1)+1);//操作数1}}//for} //crevoid build(int a[],int len,int up)//数组，总数，范围