class Solution
{
public:
ListNode *swapPairs(ListNode *head)
{
if (head == nullptr || head->next == nullptr)
return head;
ListNode dummy(-1);
dummy.next = head;
ListNode *pre = &dummy;
ListNode *cur = pre->next;
ListNode *next = cur->next;
while ((cur = pre->next) && (next = cur->next))
{
cur->next = next->next;
next->next = cur;
pre->next = next;
pre = cur;
}
return dummy.next;
}
};
04-29
04-29
04-29
04-29
09-06
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交