题目描述
给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。
示例 1:
1->2->3->4->5
5->4->3->2->1
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
代码
c
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
// 1.快慢双指针法
struct ListNode* reverseList(struct ListNode* head)
{
struct ListNode *prev = NULL;
struct ListNode *cur = head;
struct ListNode *tmp = NULL;
while(cur != NULL) {
tmp = cur;
cur = cur->next;
tmp->next = prev;
prev = tmp;
}
return prev;
}
// 2,递归解法
struct ListNode* reverse(struct ListNode* prev, struct ListNode* cur)
{
// 遍历到链表尾
if (cur == NULL) {
return prev;
}
struct ListNode* next = cur->next;
cur->next = prev;
return reverse(cur, next);
}
struct ListNode* reverseList(struct ListNode* head)
{
return reverse(NULL, head);
}