blob: b5ad8324610c5a9ae14e39ca3137081e951f720b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
#include <iostream>
using namespace std;
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) {}
};
// implementation
class Solution {
public:
ListNode *swapNodes(ListNode *head, int k) {
ListNode *x = head, *y = head, *t = head;
while (k > 1) {
x = x->next;
t = t->next;
k--;
}
while (t->next) {
y = y->next;
t = t->next;
}
int temp = x->val;
x->val = y->val;
y->val = temp;
return head;
}
};
// end
int main() {
ListNode *l = new ListNode(1);
l->next = new ListNode(2);
l->next->next = new ListNode(3);
l->next->next->next = new ListNode(4);
l->next->next->next->next = new ListNode(5);
int k = 2;
Solution *sol = new Solution();
sol->swapNodes(l, k);
}
|