题目
- 给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
题解
- 反转链表,将当前节点的
next
指向prev
, 采用双指针prev
,curr
- 注意: 要采用 nextTmp 临时存放 next ,以防止丢失
/**
* 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 nextTmp = curr.next ;
curr.next = prev ;
prev = curr ;
curr = nextTmp ;
}
return prev ;
}
}