-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathHash.java
More file actions
56 lines (47 loc) · 1.3 KB
/
Copy pathHash.java
File metadata and controls
56 lines (47 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
package Array;
public class Hash {
private Element[] table;
private boolean[] deleted;
private int N;
public Hash(int N){
table = new Element[N];
deleted = new boolean[N];
this.N = N;
}
private int hashFunction(int value){
return value % N;
}
public Element search(int value){
int address;
address = hashFunction(value);
while (table[address] != null){
if (!deleted[address] && table[address].getData() == value){
break;
}
address = (address + 1) % N;
}
return table[address];
}
public void insert(int value){
int address;
address = hashFunction(value);
while (table[address] != null && !deleted[address]){
address = (address + 1) % N;
}
if (table[address] != null){
deleted[address] = false;
}
table[address] = new Element(value);
}
public void deleteValue(int value){
int address;
address = hashFunction(value);
while (table[address] != null){
if (!deleted[address] && table[address].getData() == value){
break;
}
address = (address + 1) % N;
}
deleted[address] = true;
}
}