题目:
给你单链表的头节点 head
,请你反转链表,并返回反转后的链表。
示例一:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例二:
输入:head = [1,2]
输出:[2,1]
示例三:
输入:head = []
输出:[]
提示:
- 链表中节点的数目范围是 [0, 5000]
- -5000 <= Node.val <= 5000
思路一:
特殊情况:链表为空
代码:
struct ListNode* reverseList(struct ListNode* head){
if(head==NULL)
return NULL;
struct ListNode*n1,*n2,*n3;
n1=NULL;
n2=head;
n3=head->next;
while(n2)
{
//翻转
n2->next=n1;
//移动
n1=n2;
n2=n3;
if(n3)
n3=n3->next;
}
return n1;
}
思路二:
代码:
struct ListNode* reverseList(struct ListNode* head){
struct ListNode*newHead=NULL;
struct ListNode*cur=head;
while(cur)
{
struct ListNode*next=cur->next;
//头插
cur->next=newHead;
newHead=cur;
//迭代
cur=next;
}
return newHead;
}