forked from zapellass123/OpenEmailGenerator
-
Notifications
You must be signed in to change notification settings - Fork 0
/
UnionLL.cpp
157 lines (128 loc) · 2.43 KB
/
UnionLL.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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
/*
Given a two Linked Lists, find out union of both given input lists and return the new Linked List.
Order of elements are not important.
Note : You don't need to print the linked list, just return the head. It will be printed internally.
Input format :
Line 1 : Linked list 1 elements (separated by space and terminated by -1)
Line 2 : Linked list 2 elements (separated by space and terminated by -1)
Sample Input 1 :
1 2 3 4 -1
8 7 5 3 -1
Sample Output 1 :
1
2
3
4
8
7
5
Sample Input 2 :
1 2 1 1 -1
8 -1
Sample Output 2 :
1
2
1
1
8
*/
/*class ListNode {
public:
T data;
ListNode<T> *next;
ListNode<T>(T data)
{
this -> data=data;
next = NULL;
}
};
*/
#include <unordered_map>
#include <vector>
#include <iostream>
using namespace std;
template <typename T>
class ListNode {
public:
T data;
ListNode<T> *next;
ListNode<T>(T data)
{
this -> data=data;
next = NULL;
}
};
ListNode<int> *unionOf2LL(ListNode<int> *head1,ListNode<int> *head2)
{
if(head1==NULL)
return head2;
if(head2==NULL)
return head1;
ListNode<int> * union1=head1;
unordered_map<int,int> m;
vector<int>v;
ListNode<int>* cur=head1;
while(cur->next){
m[cur->data]+=1;
cur=cur->next;
}
m[cur->data]+=1;
ListNode<int> *cur2=head2;
while(cur2){
if(m[cur2->data]!=0){
m[cur2->data]--;
}
else
v.push_back(cur2->data);
cur2=cur2->next;
}
if(v.empty())
return union1;
ListNode<int>* newHead=new ListNode<int>(v[0]);
ListNode<int>* ntail=newHead;
for(int i=1;i<v.size();i++){
ListNode<int>* t=new ListNode<int>(v[i]);
ntail->next=t;
ntail=t;
}
cur->next=newHead;
return union1;
}
ListNode<int>* createlist()
{
ListNode<int> *head=NULL;
ListNode<int> *rear=NULL;
int data;
cin>>data;
while(data!=-1)
{
ListNode<int> *newnode=new ListNode<int>(data);
if(head==NULL)
{
head=newnode;
rear=head;
}
else
{
rear->next=newnode;
rear=rear->next;
}
cin>>data;
}
return head;
}
void print(ListNode<int> * head)
{
while(head!=NULL)
{
cout<<head->data<<endl;
head=head->next;
}
}
int main()
{
ListNode<int> *head1=createlist();
ListNode<int> *head,*head2=createlist();
head=unionOf2LL(head1,head2);
print(head);
}