leetcode-solutions/src/cpp/reverse-linked-list.cpp at main · code-chaser/leetcode-solutions · GitHub

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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/
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
/*
~~~~~~~~~~~~~~~~~~~~~~~~~~~
--||author : codechaser||--
~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
classSolution
{
public:
 ListNode *reverseList(ListNode *head)
 {
 ListNode *last = head, *lastToLast = NULL, *temp;
while (last != NULL)
 {
 temp = last->next;
 last->next = lastToLast;
 lastToLast = last;
 last = temp;
 }
return lastToLast;
 }
};
/*
 |---------------------------------------------------|
 ||| https://codeforces.com/profile/codechaser |||
 ||| https://www.codechef.com/users/codechaser |||
 ||| https://github.com/code-chaser |||
 |---------------------------------------------------|
*/