链表类问题
来源:互联网 发布:自然语言编程 编辑:程序博客网 时间:2024/06/07 14:34
1. 单链表反序
#include <iostream>
using namespace std;
typedef struct node{
int data;
node *next;
}node;
int main(){
node n1,n2,n3,n4,n5;
n1.data=1;
n2.data=2;
n3.data=3;
n4.data=4;
n5.data=5;
n1.next=&n2;
n2.next=&n3;
n3.next=&n4;
n4.next=&n5;
n5.next=NULL;
node *p1=&n1;
node *p2;
node *p3;
p2=p1->next;
while(p2!=NULL){
//p2=p1->next;
p3=p2->next;
p2->next=p1;
p1=p2;
p2=p3;
}
n1.next=NULL;
return 0;
}
2. 指定位置建环
void ring(node* n,int num){node* tail;node* first=n;node* second=n;for(int i=0;i<num;i++){if(first->next!=NULL)first=first->next;}while(second->next){second=second->next;}tail=second;tail->next=first;}
3.单链表是否有环
void ifhasring(node* n){node *pp1=n;node *pp2=n;while(pp1->next){pp1=pp1->next;if(pp2==NULL) break;pp2=pp2->next->next;if(pp1==pp2){cout<<pp1->data<<endl;break;}}}