学步园

#include<stdio.h><br /> #include<stdlib.h><br /> #include<malloc.h><br /> struct st<br /> {<br /> int num;<br /> struct st * next;<br /> };<br /> struct st * create();<br /> struct st * insert(struct st * head);<br /> struct st * zeng(struct st * head);<br /> struct st * shan(struct st * head);<br /> struct st * nixu(struct st * head);<br /> struct st * search(struct st *head);<br /> int size (struct st * head);<br /> int main()<br /> {<br /> struct st * head,*p;<br /> int i=3;<br /> head=create();<br /> insert(head);<br /> p=head;<br /> p=p->next ;<br /> while(p){<br /> printf("%d ",p->num);<br /> p=p->next ;<br /> }<br /> printf("/n");<br /> zeng(head);<br /> shan(head);<br /> p=head;<br /> p=p->next ;<br /> while(p){<br /> printf("%d ",p->num);<br /> p=p->next ;<br /> }<br /> printf("/n");<br /> printf("逆序之后:/n");<br /> nixu(head);<br /> p=head;<br /> p=p->next ;<br /> while(p){<br /> printf("%d ",p->num);<br /> p=p->next ;<br /> }<br /> printf("/n");<br /> printf("删除重复节点:/n");<br /> search(head);<br /> p=head;<br /> p=p->next ;<br /> while(p){<br /> printf("%d ",p->num);<br /> p=p->next ;<br /> }<br /> return 0;<br /> }<br /> struct st * nixu(struct st * head)<br /> {<br /> struct st * p,*s;<br /> p=head;<br /> p=p->next ;<br /> head->next =NULL;<br /> while(p)<br /> {<br /> s=p;<br /> p=p->next;<br /> s->next =head->next ;<br /> head->next =s;<br /> }<br /> return 0;<br /> }<br /> struct st * shan(struct st * head)<br /> {<br /> struct st * q,*p;<br /> int n;<br /> printf("请输入要删除的节点:/n");<br /> scanf("%d",&n);<br /> int j=0;<br /> p=head;<br /> while(p&&j<n-1){<br /> p=p->next ;<br /> j++;<br /> }<br /> q=p->next ;<br /> p->next =q->next ;<br /> free(q);</p> <p> return 0;<br /> }<br /> struct st * zeng(struct st * head)<br /> {<br /> struct st * p,* q;<br /> int j=0,n;<br /> printf("输入要插入的位置:/n");<br /> scanf("%d",&n);<br /> int i;<br /> i=size(head);<br /> if(0<n&&n<i+1)<br /> {<br /> p=head;<br /> while(p&&j<n-1){<br /> p=p->next ;<br /> j++;<br /> }<br /> printf("输入要插入的数:/n");<br /> q=(struct st *)malloc(sizeof(st));<br /> scanf("%d",&q->num);<br /> q->next =p->next ;<br /> p->next =q;<br /> p=p->next ;<br /> p=head;<br /> p=p->next ;<br /> while(p){<br /> printf("%d ",p->num);<br /> p=p->next ;<br /> }<br /> printf("/n");<br /> }<br /> else{<br /> printf("输入有误/n");<br /> }<br /> return 0;<br /> }<br /> struct st * create()<br /> {<br /> struct st * head=NULL;<br /> head=(struct st * )malloc(sizeof(st));<br /> return head;<br /> }<br /> struct st * insert(struct st * head)<br /> {<br /> printf("请输入号码(以-1结束):/n");<br /> struct st *p=NULL,*q=NULL;<br /> int i;<br /> q=head;<br /> p=(struct st *)malloc(sizeof(st));<br /> while(scanf("%d",&p->num)!=EOF)<br /> {<br /> if(p->num==-1)<br /> break;<br /> q->next=p;<br /> q=p;<br /> p=(struct st *)malloc(sizeof(st));<br /> }q->next=NULL;<br /> return 0;<br /> }<br /> struct st * search(struct st *head)<br /> {<br /> struct st *p,*q,*r;<br /> p=head->next;<br /> while(p){<br /> q=p;<br /> while(q->next){<br /> if(q->next->num==p->num)<br /> {<br /> r=q->next;<br /> q->next =r->next ;<br /> free(r);<br /> }<br /> else{<br /> q=q->next ;<br /> }</p> <p> }p=p->next ;<br /> }<br /> return 0;<br /> }<br /> int size(struct st * head)<br /> {<br /> int i=0;<br /> struct st * p;<br /> p=head;<br /> p=p->next ;<br /> while(p)<br /> {<br /> i++;<br /> p=p->next ;<br /> }<br /> return i;<br /> }