Leetcode206:反转链表(简单)
参考链接:https://www.bilibili.com/video/BV1hi4y1k7Ho?p=14
给你单链表的头节点 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
进阶:链表可以选用迭代或递归方式完成反转。你能否用两种方法解决这道题?
双指针
struct ListNode* reverseList(struct ListNode* head){
struct ListNode *pre,*cur;
pre=NULL;
cur = head;
while(cur)
{
struct ListNode *curnext = cur->next;
cur->next = pre;
pre=cur;
cur = curnext;
}
return pre;
}