给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
ListNode cur = head;
ListNode pre = null;
ListNode temp = null;
while(cur != null){ //每次循环,都将当前节点指向前一个节点
temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
}
}
当循环到最后一个节点时,temp指向null,cur指向前节点,pre指向最后一个节点,因此最后返回的是pre.