思想
采用头插法,依次遍历原链表,变换 next 指向。
编码
public Node reverse(Node node) {
Node result = null;
while (node != null){
Node next = node.next;
node.next = result;
result = node;
node = next;
}
return result;
}
采用头插法,依次遍历原链表,变换 next 指向。
public Node reverse(Node node) {
Node result = null;
while (node != null){
Node next = node.next;
node.next = result;
result = node;
node = next;
}
return result;
}