题目链接:
力扣-剑指 Offer 24. 反转链表https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/
题目内容:
定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
限制:
0 <= 节点个数 <= 5000
自己的求解思路:
迭代实现
代码实现:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
// 迭代
ListNode* cur = head;
ListNode* pre = NULL;
while(cur != NULL){
ListNode* tmp = cur->next;
cur->next = pre;
pre = cur;
cur = tmp;
}
return pre;
}
};
其他求解思路:
递归实现
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverse(ListNode* cur,ListNode* pre){
if(cur == NULL){
return pre;
}
ListNode* tmp = cur->next;
cur->next = pre;
return(reverse(tmp,cur));
}
ListNode* reverseList(ListNode* head) {
// 递归实现
return reverse(head,NULL);
}
};