forked from LogicFirstTamil/DSA-in-JAVA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDynamicArrayDemo.java
154 lines (121 loc) · 3.61 KB
/
DynamicArrayDemo.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
/*
* List Implementation using Array - generic
*
*/
import java.util.*;
class DynamicArray<T> implements Iterable<T>{ //variables - methods
private static final int initialCapacity = 16;
private T arr[];
private int size;
private int capacity;
@SuppressWarnings("unchecked")
DynamicArray(){
size = 0;
arr = (T[]) new Object[initialCapacity];
capacity = initialCapacity;
}
public void add(T val) {
if(size==capacity)
expandArray();
arr[size++] = val;
}
private void expandArray() {
capacity *= 2;
arr = java.util.Arrays.copyOf(arr,capacity);
}
public void display() {
System.out.println("Elements in the list: ");
for(int i=0;i<size;i++)
System.out.print(arr[i] + " ");
}
public void insertAtPos(int pos,T val) {
if(size==capacity)
expandArray();
for(int i=size-1;i>=pos;i--)
arr[i+1] = arr[i];
arr[pos] = val;
size++;
}
public void deleteAtPos(int pos) {
for(int i=pos+1;i<size;i++)
arr[i-1] = arr[i];
size--;
if(capacity > initialCapacity && capacity > 3*size)
shrinkArray();
}
private void shrinkArray() {
capacity /= 2;
arr =java.util.Arrays.copyOf(arr, capacity);
}
public int length() {
return size;
}
public Iterator<T> iterator(){
return new Iterator<T>(){
int index = 0;
public T next() {
return arr[index++];
}
public boolean hasNext() {
return index < size;
}
};
}
}
public class DynamicArrayDemo {
public static void main(String[] args) {
int val,pos;
DynamicArray<Integer> list = new DynamicArray<Integer>();
Scanner scanner = new Scanner(System.in);
while(true) {
System.out.println("\n -------- List Menu -----------\n");
System.out.println("1.Insert at End\n");
System.out.println("2.Display the list\n");
System.out.println("3.Insert at specified position \n");
System.out.println("4.Delete from specified position\n");
System.out.println("5.Exit\n");
System.out.println("\n--------------------------------------\n");
System.out.println("Enter your choice:\t");
int choice = scanner.nextInt();
switch(choice) {
case 1: System.out.print("Enter the data: ");
val = scanner.nextInt();
list.add(val);
break;
case 2: list.display();
break;
case 3: System.out.println("Enter the pos(starts at 0): ");
pos = scanner.nextInt();
if(pos<0){
System.out.println("Invalid position");
break;
}
System.out.print("Enter the data: ");
val = scanner.nextInt();
list.insertAtPos(pos,val);
break;
case 4: System.out.println("Enter the pos(starts at 0): ");
pos = scanner.nextInt();
if(pos<0){
System.out.println("Invalid position");
break;
}
list.deleteAtPos(pos);
break;
case 5: System.exit(0);
default: System.out.println("Invalid Choice ");
}
}
}
}
/* Exercise
*
* delete at end
* delete from beginning
* insert at beginning
* get(index) get(2)
* update(index,val) update(3,5) arr[index] = val;
* search(val) -> return index
* clear
* contains(val)
*/