给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
提示:
链表中节点的数目范围是 [0, 5000]
-5000 <= Node.val <= 5000
/**
* 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 prev = null; //前指针节点
ListNode curr = head; //当前指针节点
//如果curr = null表示结束了
while(curr != null){
ListNode nextTemp = curr.next;//临时节点,暂存当前节点的下一节点用于后移
curr.next = prev;//将当前节点指向它前面的节点
prev = curr;//前指针后移
curr = nextTemp;//当前指针后移
}
return prev;
}
}
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/reverse-linked-list