-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSame_to_Same.cpp
More file actions
77 lines (69 loc) · 1.3 KB
/
Copy pathSame_to_Same.cpp
File metadata and controls
77 lines (69 loc) · 1.3 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
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
long int val;
Node *next;
Node(int val)
{
this->val = val;
this->next = NULL;
}
};
void insert_at_tail(Node *&head, Node *&tail, long int val)
{
Node *newNode = new Node(val);
if (head == NULL)
{
head = newNode;
tail = newNode;
return;
}
tail->next = newNode;
tail = newNode;
}
void compare_and_show_output(Node *n1, Node *n2)
{
Node *Node1 = n1;
Node *Node2 = n2;
while (Node1 != NULL && Node2 != NULL)
{
if (Node1->val != Node2->val)
{
cout << "NO" << endl;
return;
}
Node1 = Node1->next;
Node2 = Node2->next;
}
if (Node1 == NULL && Node2 == NULL)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main()
{
Node *N1 = NULL;
Node *N1Tail = NULL;
Node *N2 = NULL;
Node *N2Tail = NULL;
while (true)
{
long int val;
cin >> val;
if (val == -1)
break;
insert_at_tail(N1, N1Tail, val);
}
while (true)
{
long int val;
cin >> val;
if (val == -1)
break;
insert_at_tail(N2, N2Tail, val);
}
compare_and_show_output(N1, N2);
return 0;
}