链表反转(java实现)递归非递归

public class Node {
//当前节点的数据
private int data;
//当前节点指向下的一个节点
private Node dataNext;

public int getData() {
return data;
}
public void setData(int data) {
this.data = data;
}
public Node getDataNext() {
return dataNext;
}
public void setDataNext(Node dataNext) {
this.dataNext = dataNext;
}
public Node(int data) {
super();
this.data=data;

}

//普通遍历

public static Node bianli(Node head){
Node pre = head;
Node cur = head.getDataNext();
Node next = null;
if(head==null||head.getDataNext()==null){

return head;
}
while(cur!=null){
next = cur.getDataNext();
cur.setDataNext(pre);
pre = cur;
cur = next;
}
head.setDataNext(null);
head = pre;
return head;
}

//递归实现

//head表示前一个节点，head.getDataNext表示当前节点

public static Node reverse(Node head){
//如果成立表示当前链表为空，或者只有一个元素，则直接返回
if(head==null||head.getDataNext()==null){
return head;
}
Node reNode = reverse(head.getDataNext());
head.getDataNext().setDataNext(head);
head.setDataNext(null);
return reNode;
}

public static void main(String[] args) {
Node head = new Node(1);
Node node1 = new Node(2);
Node node2 = new Node(3);
Node node3 = new Node(4);
head.setDataNext(node1);
node1.setDataNext(node2);
node2.setDataNext(node3);
//反转前
Node h = head;
while(h!=null){
System.out.println(h.getData()+"");
h = h.getDataNext();
}

//反转后
Node n = reverse(head);
while(n!=null){
System.out.println(n.getData()+"");
n = n.getDataNext();
}
}