“万物皆可递归” ,大佬们tql。循环的我瑟瑟发抖o(╥﹏╥)o
#递归
ListNode* swapPairs(ListNode* head)
{
ListNode* phead = head;
while (phead != NULL)
{
if (phead->next == NULL)
break;
int tmp = phead->next->val;
phead->next->val = phead->val;
phead->val = tmp;
phead = phead->next->next;
}
return head;
}
#循环
ListNode* swapPairs(ListNode* head)
{
if (head == NULL || head->next == NULL)
return head;
ListNode *tmp = head->next;
head->next = swapPairs(tmp->next);
tmp->next = head;
return tmp;
}