/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
if(head == nullptr) return head;
if(head->next == nullptr) return head;
ListNode* tmp = head->next;
head->next = swapPairs(tmp->next);
tmp->next = head;
return tmp;
}
};
leetcode每日一题第三十二天
最新推荐文章于 2024-09-14 18:52:56 发布