https://oj.leetcode.com/problems/swap-nodes-in-pairs/
链表的处理
/** * 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) { ListNode *dummy = new ListNode(-1); if(head == NULL) return dummy->next; dummy->next = head; ListNode *tail = dummy; ListNode *current = head; ListNode *second = head->next; while(current && second) { tail->next = second; current->next = second->next; second->next = current; current = current->next; if(current == NULL) break; second = current->next; tail = tail->next; tail = tail->next; } return dummy->next; } };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步