-
Notifications
You must be signed in to change notification settings - Fork 170
/
Copy pathlowArrayApp.java
67 lines (62 loc) · 1.18 KB
/
lowArrayApp.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
/*
* Solved by Sumeet Kulkarni (https://github.com/sumeetk321)
*/
class LowArray {
private long[] a;
public LowArray(int len) {
a = new long[len];
}
public void set(int index, long val) {
a[index] = val;
}
public long get(int index) {
return a[index];
}
}
class lowArrayApp {
public static void main(String[] args) {
LowArray arr;
arr = new LowArray(100);
int size = 0;
int j;
arr.set(0, 12);
arr.set(1, 2819);
arr.set(2, 29);
arr.set(3, 315);
arr.set(4, 2211);
arr.set(5, 1);
arr.set(6, 191);
arr.set(7, 0);
arr.set(8, 47);
arr.set(9, 317);
size = 10;
for (j = 0; j < size; j++) {
System.out.print(arr.get(j) + " ");
}
System.out.println("");
int searchKey = 78;
for (j = 0; j < size; j++) {
if (arr.get(j) == searchKey) {
break;
}
}
if (j == size) {
System.out.println("Can’t find " + searchKey);
} else {
System.out.println("Found " + searchKey);
}
for (j = 0; j < size; j++) {
if (arr.get(j) == 191) {
break;
}
}
for (int k = j; k < size; k++) {
arr.set(k, arr.get(k + 1));
}
size--;
for (j = 0; j < size; j++) {
System.out.print(arr.get(j) + " ");
}
System.out.println("");
}
}