forked from Annex5061/java-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArrayLists.java
40 lines (38 loc) · 1.24 KB
/
ArrayLists.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
import java.util.*;
class ArrayLists {
public static void main(String args[]) {
ArrayList<Integer> list = new ArrayList<Integer>();
ArrayList<String> list2 = new ArrayList<String>();
ArrayList<Boolean> list3 = new ArrayList<Boolean>();
// add elements
list.add(1);
list.add(3);
list.add(4);
list.add(5);
System.out.println(list);
// to get an element
int element = list.get(0); // 0 is the index
System.out.println(element);
// add element in between
list.add(1, 2); // 1 is the index and 2 is the element to be added
System.out.println(list);
// set element
list.set(0, 0);
System.out.println(list);
// delete elements
list.remove(0); // 0 is the index
System.out.println(list);
// size of list
int size = list.size();
System.out.println(size);
// Loops on lists
for (int i = 0; i < list.size(); i++) {
System.out.print(list.get(i) + " ");
}
System.out.println();
// Sorting the list
list.add(0);
Collections.sort(list);
System.out.println(list);
}
}