- 分析
链表题,按照题目思路做即可 - 代码
class Solution {
public:
ListNode* swapNodes(ListNode* head, int k) {
ListNode* first = head;
while(--k != 0) first = first -> next;
ListNode* fast = first;
ListNode* slow = head;
while(fast -> next != nullptr){
fast = fast -> next;
slow = slow -> next;
}
swap(first -> val, slow -> val);
return head;
}
};