题目大意:反转链表
分析:迭代/递归
代码:
迭代:
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* dummy = new ListNode(0);
ListNode* pre = dummy;
pre->next = head;
while(head && head->next){
ListNode* p = pre->next;
pre->next = head->next;
head->next = pre->next->next;
pre->next->next = p;
}
return dummy->next;
}
};
递归:
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(!head || !head->next) return head;
ListNode* p = reverseList(head->next); //拿到已反转的部分
head->next->next = head; //反转当前指针
head->next = NULL;
return p;
}
};