题目描述
输入一个链表,反转链表后,输出新链表的表头。
节点类如下:
public class Node {
public int value;
public Node next;
public Node(int data){
this.value = data;
}
}
反转单向链表的函数如下:
public Node reverseList(Node head){
if(head==null||head.next==null)//链表为空或者仅1个数直接返回
return head;
Node pre = null;
Node next = null;
while (head != null) {
next = head.next;
head.next = pre;
pre = head;
head = next;
}
return pre;
}
可以看到四行代码:
next = head.next; //1
head.next = pre; //2
pre = head; //3
head = next; //4
//第一步:next = head.next
将 head.next 赋值给 next 变量,也就是说 next 指向了节点2,先将节点2 保存起来。