-
Notifications
You must be signed in to change notification settings - Fork 481
/
0024.cpp
38 lines (36 loc) · 873 Bytes
/
0024.cpp
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
#include <iostream>
using namespace std;
// Definition for singly-linked list.
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution
{
public:
ListNode* swapPairs(ListNode* head)
{
ListNode* h = new ListNode(-1);
h->next = head;
ListNode* pre = h;
while (pre->next != nullptr && pre->next->next != nullptr)
{
ListNode* node1 = pre->next;
ListNode* node2 = node1->next;
ListNode* lat = node2->next;
pre->next = node2;
node2->next = node1;
node1->next = lat;
pre = node1;
}
ListNode* retNode = h->next;
delete h;
return retNode;
}
};
int main()
{
return 0;
}