본문 바로가기

Java스터디/문제풀이

#02 자료구조 동적 배열

Vector(동적배열)

 

TestApp

public class TestApp {
    public static void main(String[] args) {
        MyArrayList<Integer> list = new MyArrayList<>();
        list.add(1);
        list.add(2);
        list.add(3);
        list.add(4);
        list.add(5);

        System.out.println(list);
        System.out.println(list.size());

        list.remove(3); // index로 삭제 숫자 4가 삭제되어야함
        System.out.println(list);
        System.out.println(list.size());


    }
}

MyArrayList

import java.util.ArrayList;

public class MyArrayList<T> {
    public static final int STEP_NEXT = 2;
    private int size;
    private int capacity;
    private Object[] arr;

    public MyArrayList() {
        this.size = 0;
        this.capacity = 5;
        arr = new Object[capacity];
    }

    public boolean add(T data){
        return false;
    }

    public T get(int index){
        return null;
    }

    public int size(){
        return 0;
    }

    public boolean remove(int index){
        return false;
    }

    @Override
    public String toString() {
        return "";
    }
}

 

MyArrayList 답

 

반응형