-
Notifications
You must be signed in to change notification settings - Fork 2
/
MySet.java
110 lines (77 loc) · 1.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
import java.io.*;
import java.util.*;
public class MySet<T>{
private Node<T> head;
public int size;
public MySet(){
this.head = null;
this.size = 0;
}
public boolean isEmpty(){
if(this.size == 0)
return true;
else
return false;
}
public boolean isMember(T obj){
Node<T> node = this.head;
while(node != null){
if(node.data == obj)
return true;
else
node = node.next;
}
return false;
}
public void Insert(T obj, int i){
Node<T> new_node = new Node<T>(obj,null,i);
if(this.head == null)
this.head = new_node;
else{
Node<T> node = this.head;
while(node.next != null){
node = node.next;
}
node.next = new_node;
}
this.size++;
}
public void Delete(T obj){
Node<T> node = this.head;
if(node.data == obj){
this.head = node.next;
this.size--;
}
while(node.next != null){
if(node.next.data == obj){
node.next = node.next.next;
this.size--;
break;
}
else
node = node.next;
}
}
public T findIthNode(int i){
Node<T> node = this.head;
int count = 0;
while(node != null){
if(count == i)
return node.data;
else
node = node.next;
count++;
}
return null;
}
public T getNode(int i) throws ErrorException{
Node<T> node = this.head;
while(node != null){
if(node.identifier == i)
return node.data;
else
node = node.next;
}
throw new ErrorException(i);
}
}