给你单链表的头节点 head
,请你反转链表,并返回反转后的链表。
示例 1:
输入:head = [1,2,3,4,5] 输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2] 输出:[2,1]
示例 3:
输入:head = [] 输出:[]
提示:
- 链表中节点的数目范围是
[0, 5000]
-5000 <= Node.val <= 5000
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head) {
struct ListNode* dummyhead=(struct ListNode*)malloc(sizeof(struct ListNode));
dummyhead->next=NULL;
while(head!=NULL)
{
struct ListNode* x=(struct ListNode*)malloc(sizeof(struct ListNode));
x->val=head->val;
x->next=dummyhead->next;
dummyhead->next=x;
head=head->next;
}return dummyhead->next;
}
头插法反转链表