输入一个链表,反转链表后,输出新链表的表头。
代码:
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode newHead = null;
ListNode node = null;
while(head != null){
//首先保存原链表head的下一个节点
node = head.next;
//将head取下,构建新链表
head.next = newHead;
//将newHead加一,为构建新链表增加新的节点
newHead = head;
//将head后移,使原链表减一
head = node;
}
return newHead;
}
}