Leetcode 24. Swap Nodes in Pairs | | Leetcode 24. Swap Nodes in Pairs 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314151617181920/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* swapPairs(ListNode* head) { if(!head || !head->next) { return head; } ListNode* latter = head->next; head->next = swapPairs(latter->next); latter->next = head; return latter; }}; Reference https://leetcode.com/problems/swap-nodes-in-pairs/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏