Implementation Of Stack Using ArrayList

ListStack.java

import java.util.ArrayList;

public class ListStack<X> implements Stack<X> {

    private ArrayList<X> list;

    public ListStack() {
        list = new ArrayList<X>();
    }


    public void push(X item) {
        list.add(item);
    }


    public X pop() {
        if(list.size()==0)
            throw new IllegalStateException("Stack is empty");
        return list.remove(list.size()-1);
    }


    public boolean contains(X item) {
        return list.contains(item);
    }


    public X access(X item) {
        try {
            while (true) {
                    if (item == pop())
                        return item;
                }

            }
        catch (Exception e){
            System.out.println("Item not found on the stack");
            return null;
        }

    }


    public int size() {
        return list.size();
    }
}