Java版链表逆序

package com.test;


public class Test {
class Node{
private int num;
private Node next;
public Node(int num,Node node){
this.num = num;
this.next = node;
}
public void setNum(int num){
this.num = num;
}
public void setNext(Node node){
this.next = node;
}
}
//创建链表
public Node createList(int arr[],int len){
Node head = null;
if(len < 1){
return null;
}
head = new Node(arr[0],null);
Node next = head;
Node temp = null;
for(int i=1;i<len;i++){
temp = new Node(arr[i],null);
next.next = temp;
next = temp;
}
return head;

}

        //链表逆序

public Node reverseList(Node head){
if(head == null){
return null;
}
Node flag = null;
Node next = head;
while(next != null){
head = next;
next = next.next;
head.next = flag;
flag = head;
}
return head;

}

        //打印链表

public void printList(Node node){
while(node != null){
System.out.print(node.num+",");
node = node.next;
}
System.out.println();

}

        //测试

public static void test(){
int arr[] = {1,2,3,4,5,6,7,8};
Test test = new Test();
Node head = test.createList(arr, arr.length);
test.printList(head);
Node temp = test.reverseList(head);
test.printList(temp);
}

public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("hello java!");
Test.test();
}


}