反转链表
作者:互联网
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/reverse-linked-list
给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
点击查看代码
public ListNode reverseList(ListNode head) {
if(head == null){
return head;
}
ListNode prev = null;
ListNode curr = head;
while(curr != null){
ListNode tmp = curr.next;
curr.next = prev;
prev = curr;
curr = tmp;
}
return prev;
}
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
标签:head,ListNode,示例,反转,链表,curr,prev 来源: https://www.cnblogs.com/xy7112/p/16412741.html