-
Notifications
You must be signed in to change notification settings - Fork 34
/
EvenAfterOddLL
88 lines (83 loc) · 1.64 KB
/
EvenAfterOddLL
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
#include <iostream>
class node{
public:
int data;
node * next;
node(int data){
this->data=data;
this->next=NULL;
}
};
using namespace std;
node* takeinput(){
int data;
cin>>data;
node* head=NULL,*tail=NULL;
while(data!=-1){
node *newnode=new node(data);
if(head==NULL) {
head=newnode;
tail=newnode;
}
else{
tail->next=newnode;
tail=newnode;
}
cin>>data;
}
return head;
}
void print(node *head)
{
node*temp=head;
while(temp!=NULL)
{
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
node* arrange_LinkedList(node* head){
node* oddHead = NULL;
node* oddTail = NULL;
node* evenHead = NULL;
node* evenTail = NULL;
while(head!=NULL){
if(head->data%2!=0){
if(oddHead == NULL){
oddHead=head;
oddTail=head;
}
else{
oddTail->next=head;
oddTail=oddTail->next;
}
}
else{
if(evenHead == NULL){
evenHead=head;
evenTail=head;
}
else{
evenTail->next=head;
evenTail=evenTail->next;
}
}
head = head->next;
}
if(oddTail==NULL){
return evenHead;
}
if(evenHead==NULL){
return oddHead;
}
oddTail->next = evenHead;
return oddHead;
}
int main()
{
node*head=takeinput();
head=arrange_LinkedList(head);
print(head);
return 0;
}