#include<iostream>
using namespace std;
struct Node {
int data;
struct Node* next;
};
Node* ReverseList (Node* start) {
Node* node=NULL;
while(start->next!=NULL){
Node* next=start->next;
start->next=node;
node=start;
start=next;
}
start->next=node;
return start;
}
void main()
{
Node* start=new Node();
start->data=0;
start->next=NULL;
Node* a=start;
for(int i=1;i<10;i++){
Node* listNode=new Node();
listNode->data=i;
listNode->next=NULL;
a->next=listNode;
a=a->next;
}
Node* b=start;
/* while(b!=NULL){
cout<<b->data<<endl;
b=b->next;
}*/
b=ReverseList(start);
while(b!=NULL){
cout<<b->data<<endl;
b=b->next;
}
using namespace std;
struct Node {
int data;
struct Node* next;
};
Node* ReverseList (Node* start) {
Node* node=NULL;
while(start->next!=NULL){
Node* next=start->next;
start->next=node;
node=start;
start=next;
}
start->next=node;
return start;
}
void main()
{
Node* start=new Node();
start->data=0;
start->next=NULL;
Node* a=start;
for(int i=1;i<10;i++){
Node* listNode=new Node();
listNode->data=i;
listNode->next=NULL;
a->next=listNode;
a=a->next;
}
Node* b=start;
/* while(b!=NULL){
cout<<b->data<<endl;
b=b->next;
}*/
b=ReverseList(start);
while(b!=NULL){
cout<<b->data<<endl;
b=b->next;
}
}
单链表的逆序~~~
太久没有编程,连struct的初始化都搞了很久,无奈~~
以后要每天写点代码,fighting!