给你单链表的头节点
head
,请你反转链表,并返回反转后的链表。
输入:head = [1,2,3,4,5] 输出:[5,4,3,2,1]
输入:head = [1,2]
输出:[2,1]
示例 3:输入:head = []
输出:[]
提示:
链表中节点的数目范围是 [0, 5000]
-5000 <= Node.val <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/reverse-linked-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
java迭代法:
/**
* 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;
//每次循环,都将当前节点指向它前面的节点,然后当前节点和前节点后移
while(curr != null){
//临时节点,暂存当前节点的下一个节点,用于后移
ListNode nextTemp = curr.next;
//将当前节点指向它前面的节点
curr.next = prev;
//前指针后移
prev = curr;
//当前指针后移
curr = nextTemp;
}
return prev;
}
}