Repository navigation
Expand file tree
/
Copy pathvArray.java
More file actions
73 lines (62 loc) · 1.39 KB
/
Copy pathvArray.java
File metadata and controls
73 lines (62 loc) · 1.39 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
package Heap;
public class vArray {
private int index, max_size;
public int[] E;
public vArray() {
this.max_size = 10000000;
E = new int[max_size];
index = 0;
}
public vArray(int max_size) {
this.max_size = max_size + 1;
E = new int[max_size];
index = 0;
}
public boolean isFull() {
return !(index < max_size);
}
public boolean isEmpty() {
return index < 1;
}
public void push(int e) {
if(isFull()) {
System.out.println("over");
return;
}
E[++index] = e;
int indexing = index;
while(indexing > 0 && E[indexing] < E[indexing/2]) {
int t = E[indexing];
E[indexing] = E[indexing/2];
E[indexing/2] = t;
indexing /= 2;
}
}
public int poll() {
if(isEmpty()) {
return -Integer.MIN_VALUE;
}
int t = E[1], indexing = 1, smaller;
E[1] = E[index];
E[index] = t;
while(indexing * 2 + 1 < index && (E[indexing] > E[indexing * 2] || E[indexing] > E[indexing * 2 + 1])) {
if(indexing * 2 + 1 > index) smaller = indexing * 2;
else smaller = (E[indexing * 2] < E[indexing * 2 + 1]) ? indexing * 2 : indexing * 2 + 1 ;
t = E[indexing];
E[indexing] = E[smaller];
E[smaller] = t;
indexing = smaller;
}
int result = E[index];
E[index--] = Integer.MIN_VALUE;
return result;
}
@Override
public String toString() {
String v = "";
for (int i = 1; i < index + 1; i++) {
v += i+ ": " + E[i] + " ";
}
return v;
}
}