题目
给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。示例 1:
输入: head = [1,2,3,4,5]
输出: [5,4,3,2,1]
示例 2:
输入: head = [1,2]
输出: [2,1]
示例 3:
输入: head = [ ]
输出: [ ]
示例 4:
输入: x = 0
输出: 0
使用递归
class Solution {
public ListNode reverseList(ListNode head) {
if(head == null || head.next == null) return head;
ListNode p = reverseList(head.next);
head.next.next = head;
head.next = null;
return p;
}
}
使用双指针
class Solution {
public ListNode reverseList(ListNode head) {
if(head == null) return null;
ListNode p = null;
ListNode cur = head;
ListNode q = head.next;
while(cur != null){
cur.next = p;
p = cur;
cur = q;
if(q != null)q = q.next;
else break;
}
return p;
}
}