-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.hpp
More file actions
136 lines (102 loc) · 2.52 KB
/
Solution.hpp
File metadata and controls
136 lines (102 loc) · 2.52 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
//
// Created by cfwloader on 2/20/16.
//
#ifndef PROBLEM328_SOLUTION_HPP
#define PROBLEM328_SOLUTION_HPP
/**
* Definition for singly-linked list.
**/
struct ListNode
{
int val;
ListNode *next;
ListNode(int x) : val(x), next(nullptr)
{ }
};
class Solution
{
public:
// Notice that this problem is about calculating the equivalent index of the nodes, not the nodes' stored value.
ListNode *oddEvenList(ListNode *head)
{
if(head == nullptr)
{
return nullptr;
}
if(head->next == nullptr)
{
return head;
}
ListNode* oddHead = head, *evenHead = head->next;
head->next = evenHead->next;
ListNode* ptr = head->next, *oddPtr = oddHead, *evenPtr = evenHead;
for(int index = 3; ptr != nullptr; ++index, ptr = ptr->next)
{
if(index % 2 != 0)
{
oddPtr->next = ptr;
oddPtr = oddPtr->next;
}
else
{
evenPtr->next = ptr;
evenPtr = evenPtr->next;
}
}
evenPtr->next = nullptr;
oddPtr->next = evenHead;
return oddHead;
}
ListNode *oddEvenList0(ListNode *head) // Wrong Answer because of wrong comprehension of requirement.
{
if(head == nullptr)
{
return nullptr;
}
if(head->next == nullptr)
{
return head;
}
ListNode* head1 = head, *head2 = head->next;
head->next = head2->next;
int traitValue = head1 -> val % 2;
ListNode* ptr = head1->next, *ptr1 = head1, *ptr2 = head2;
while(ptr != nullptr)
{
if(ptr->val % 2 == traitValue)
{
ptr1->next = ptr;
ptr1 = ptr1->next;
}
else
{
ptr2->next = ptr;
ptr2 = ptr2->next;
}
ptr = ptr->next;
}
ptr2->next = nullptr;
ptr1->next = head2;
return head1;
}
/*
ListNode* findNextOddNode(ListNode* node)
{
if(node == nullptr)
{
return nullptr;
}
ListNode* target = node->next;
while(target != nullptr)
{
if(target->val % 2 == 0)
{
return target;
}
target = target->next;
}
return target;
}
*/
};
#endif //PROBLEM328_SOLUTION_HPP