-
Notifications
You must be signed in to change notification settings - Fork 0
/
206_Reverse_Linked_List.cpp
50 lines (48 loc) · 996 Bytes
/
206_Reverse_Linked_List.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
39
40
41
42
43
44
45
46
47
48
49
50
#include<iostream>
#include<vector>
#include<string>
#include<map>
using namespace std;
static const auto x=[](){
std::ios::sync_with_stdio(false);
std:cin.tie(nullptr);
return nullptr;
}();
struct ListNode
{
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution
{
public:
ListNode* reverseList(ListNode* head)
{
ListNode* res = new ListNode(-1);
while(head != NULL)
{
ListNode* origin_head = res->next;
res->next = head;
head = head->next;
res->next->next = origin_head;
}
return res->next;
}
};
int main(int argc, char const *argv[])
{
ListNode a(1), b(2), c(3), d(4), e(5);
a.next = &b;
b.next = &c;
c.next = &d;
d.next = &e;
Solution sol;
ListNode* res = sol.reverseList(&a);
while( res != NULL)
{
cout<<res->val<<"\t";
res =res->next;
}
return 0;
}