-
Notifications
You must be signed in to change notification settings - Fork 0
/
Arrange Consonants and Vowels.cpp
121 lines (104 loc) · 2.1 KB
/
Arrange Consonants and Vowels.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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
struct Node
{
char data;
struct Node *next;
Node(int x){
data = x;
next = NULL;
}
};
void printlist(Node *head)
{
if (head==NULL)return;
while (head != NULL)
{
cout << head->data << " ";
head = head->next;
}
cout << endl;
}
void append(struct Node** headRef, char data)
{
struct Node* new_node = new Node(data);
struct Node *last = *headRef;
if (*headRef == NULL)
{
*headRef = new_node;
return;
}
while (last->next != NULL)
last = last->next;
last->next = new_node;
return;
}
// } Driver Code Ends
/*
Structure of the node of the linked list is as
struct Node
{
char data;
struct Node *next;
Node(int x){
data = x;
next = NULL;
}
};
*/
class Solution
{
public:
// task is to complete this function
// function should return head to the list after making
// necessary arrangements
bool check(Node* temp){
if(temp->data=='a' || temp->data=='e' || temp->data=='i' || temp->data=='o' || temp->data=='u') return true;
return false;
}
struct Node* arrangeCV(Node *head)
{
//Code here
vector<char>vowel,consonant;
Node* temp=head;
while(temp!=NULL){
if(check(temp)) vowel.push_back(temp->data);
else consonant.push_back(temp->data);
temp=temp->next;
}
Node* dummy =new Node(-1);
temp=dummy;
for(int i=0;i<vowel.size();i++){
temp->next=new Node(vowel[i]);
temp=temp->next;
}
for(int i=0;i<consonant.size();i++){
temp->next=new Node(consonant[i]);
temp=temp->next;
}
return dummy->next;
}
};
//{ Driver Code Starts.
// task is to complete this function
int main()
{
int T;
cin>>T;
while(T--){
int n;
char tmp;
struct Node *head = NULL;
cin>>n;
while(n--){
cin>>tmp;
append(&head, tmp);
}
Solution obj;
head = obj.arrangeCV(head);
printlist(head);
}
return 0;
}
// } Driver Code Ends