java 实现单链表反转:
class node{
int data;
node next;
public node(int data){
this.data=data;
this.next=null;
}
}
public class lianbiao {
public static void main(String[] args) {
int []arr= {2,5,3,4,1,0};
node p,fore,pnext;
node head=new node(arr[0]);
p=head;
for(int i=1;i<arr.length;i++){
p.next=new node(arr[i]);
p=p.next;
}
p=head;
while(p!=null){
System.out.print(p.data+" ");
p=p.next;
}
p=head;
fore=null;
while(p.next!=null){
pnext=p.next;
p.next=fore;
fore=p;
p=pnext;
}
p.next=fore;
System.out.println(" ");
while(p!=null){
System.out.print(p.data+" ");
p=p.next;
}
}
}
结果显示:
2 5 3 4 1 0
0 1 4 3 5 2