-
Notifications
You must be signed in to change notification settings - Fork 3
/
Myset.java
236 lines (203 loc) · 4.42 KB
/
Myset.java
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
public class Myset{
LinkedList set;
Myset(){
set=new LinkedList();
}
public int size()
{
return set.Size();
}
//public Boolean IsEmpty(): returns true if the set is empty
public Boolean IsEmpty(){
return set.IsEmpty();
}
//public Boolean IsMember(Object o) Returns true if o is in the set, false otherwise.
public Boolean IsMember(Object o){
if (set.Find( o)==null) {
return false;
}
else
return true;
}
//– public void Insert(Object o): Inserts o into the set.
public void Insert(Object o){
if(!IsMember(o)){
set.Insert(o);
}
}
//– public void Delete(Object o): Deletes o from the set, throws exception if o is not in the set.
public void Delete(Object o) throws Exception{
// System.out.println("hbje");
set.Delete(o);
}
//– public Myset Union(Myset a): Returns a set which is the union of the current set with the set a.
public Myset Union(Myset a){
Myset c=new Myset();
LinkedList.Node n = set.Peek();
while(n!=null){
c.Insert(n.data);
n=n.next;
}
n=a.set.Peek();
while(n!=null){
if (!IsMember(n.data)) {
c.Insert(n.data);
}
n=n.next;
}
return c;
}
//public Myset Intersection(Myset a): Returns a set which is the intersection of the current set with the set a
public Myset Intersection(Myset a){
Myset c=new Myset();
LinkedList.Node n=set.Peek();
while(n!=null){
if( a.IsMember(n.data))
{
c.Insert(n.data);
// System.out.println("inserted an elment in inter set");
}
n=n.next;
}
return c;
}
public String toString()
{
return set.toString();
}
public static void main(String[] args) {
Myset a = new Myset();
System.out.println(a.IsEmpty());
a.Insert(1);
a.Insert(2);
a.Insert(3);
a.Insert(4);
a.Insert(5);
System.out.println(a.IsEmpty());
Myset b = new Myset();
b.Insert(4);
b.Insert(3);
b.Insert(0);
b.Insert(9);
b.Insert(7);
b.Insert(-1);
System.out.println(a.IsMember(1));
System.out.println(a.IsMember(7));
System.out.println(a);
try{a.Delete(3);}catch(Exception e){
System.out.println(e);
}
System.out.println(a);
System.out.println(b);
System.out.println(a.Union(b));
System.out.println(a.Intersection(b));
}
}
class LinkedList{
class Node{
Object data;
Node next;
Node prev;
Node(Object d){
data=d;
next=null;
prev=null;
}
}
Node head;
Node tail;
public int Size(){
Node n=head; int count=0;
while(n!=null){
++count;
n=n.next;
}
return count;
}
public Node Peek()
{
return head;
}
public String toString()
{
String str= "";
Node n = head;
while(n != null)
{
str = str+n.data.toString();
n = n.next;
}
return str;
}
public Node Find(Object d)
{
// System.out.println("finding "+d)
Node n = head;
while(n != null && d != n.data)
{
n = n.next;
}
return n;
}
public Boolean IsEmpty(){
if(head==null)
return true;
else
return false;
}
public boolean Insert(Object d){
if (head==null) {
Node new_node=new Node(d);
head=new_node;
tail=head;
}
else{
Node new_node=new Node(d);
tail.next=new_node;
new_node.prev=tail;
tail=new_node;
}
return true;
}
public void Delete(Object o)
{
Node new_node = Find(o);
if(new_node == null)
{
throw new IllegalStateException();
}
else
{
Delete(new_node);
}
}
public Node Delete(Node node)
{
if(node == head)
{
if(head == tail)
{
head = null;
tail = null;
}
else
{
head = head.next;
head.prev = null;
}
}
else
{
node.prev.next = node.next;
if(node.next != null)
{
node.next.prev = node.prev;
}
else
{
tail = node.prev;
}
}
return node.next;
}
}