-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path22.11.1.cpp
107 lines (89 loc) · 1.89 KB
/
22.11.1.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
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
#include <iostream>
using namespace std;
class node{
public:
int data;
node* next;
node(int val){
data = val;
next = NULL;
}
};
void insertAtHead(node* &head, int val){
node* n = new node(val);
if(head == NULL){
head = n;
return;
}
n->next = head;
head = n;
}
void insertAtTale(node* &head, int val){
if(head==NULL){
insertAtHead(head, val);
return;
}
node* n = new node(val);
node* temp = head;
while(temp->next != NULL){
temp = temp->next;
}
temp->next = n;
}
void display(node* &head){
node* temp = head;
while(temp!=NULL){
cout<<temp->data<<"->";
temp = temp->next;
}
cout<<"NULL\n";
}
node* oddeven(node* head){
if(head->next == NULL){
return head;
}
node* tempNode = head;
node* prev = oddeven(head->next);
if(tempNode->data %2 != 0){
tempNode->next = prev;
return tempNode;
}else{
node* temp = prev;
while(temp->next!=NULL){
temp = temp->next;
}
// cout<<temp->data<<" "<<tempNode->data<<endl;
tempNode->next = NULL;
temp->next = tempNode;
return prev;
}
}
node* oddeven2(node* head){
node* odd = head;
node* even = head->next;
node* evenStart = even;
while(odd ->next != NULL and even->next != NULL){
odd->next = even->next;
odd = odd->next;
even->next = odd->next;
even=even->next;
}
odd->next = evenStart;
return head;
}
int main(){
node* head = NULL;
int n;
cin>>n;
for(int i=0; i<n; i++){
int temp;`
cin>>temp;
insertAtTale(head, temp);
}
display(head);
// node* newHead = oddeven(head);
// display(newHead);
node* newHead = oddeven2(head);
display(newHead);
return 0;
}