Arraylist implementation

Similar question:

•  dynamic array implementation
•  custom arraylist implementation
•  own arraylist implementation

1. class MyArray<E> {
2. static int length = 0;
3. static int capacity = 10;
4. static Object arr[];
5. MyArray(){
6.  arr = new Object[capacity];
7. }
8. public void add(E value) {
9. if (capacity == length) {
10. increaseCapacity();
11. }
12. arr[length] = value;
13. length++;
14. }
15. 
    
16. public static void increaseCapacity() {
17. capacity=capacity*2;
18. arr=Arrays.copyOf(arr, capacity);
19. }
20. 
    
21. public static int size() {
22. return length;
23. }
24. public E get(int index) {
25. if(index>length){
26. throw new ArrayIndexOutOfBoundsException();
27. }
28. else return (E) arr[index];
29. }
30. public boolean contain(E value) {
31. for(int i=0;i<length;i++){
32. if(arr[i]==value)
33. return true;
34. }
35. return false;
36. }
37. }

Test

---

1. public class Array1 {
2. public static void main(String[] args) {
3. MyArray m2=new MyArray();
4. m2.add(1);
5. m2.add("2");
6. for (int i = 0; i < m2.length; i++) {
7. System.out.println(m2.get(i));
8. }
9. }
10. }