反向单链列表Java

Node next = tmp.next;
while(tmp != null){

那么，当tmp == null时会发生什么呢？

不过，您几乎明白了。

Node before = null;Node tmp = head;while (tmp != null) {    Node next = tmp.next;    tmp.next = before;    before = tmp;    tmp = next;}head = before;

或者用更好的（？）命名：

Node reversedPart = null;Node current = head;while (current != null) {    Node next = current.next;    current.next = reversedPart;    reversedPart = current;    current = next;}head = reversedPart;

ASCII文字：

        <__<__<__ __ : reversedPart    : head      (__)__ __ __head :   current:      >  >  >