Project Euler #4 Java Solution

import java.util.ArrayList;
import java.util.Collections;
public class Euler4{
    public static void main(String [] args){
        int size = 0;
        int product = 0;
        ArrayList<Integer> palindromes = new ArrayList<Integer>();
        for(int i = 999; i > 100; i--){
            for(int j = 100; j < i; j++){
                ArrayList<Integer> digits = new ArrayList<Integer>();
                product = i*j;
                int productcopy = product;
                int index = 0;

                while(product != 0){
                    digits.add(index,product%10);
                    product /= 10;
                    //System.out.println("digits :" + digits.get(index) + " index: " + index);
                    index++;

                }

                size = digits.size() - 1;

                if(test(0,size,digits)){
                    palindromes.add(productcopy);
                    break;
                }
            }
        }
        Object max = Collections.max(palindromes);
        System.out.println("answer: " + max);
    }

    public static boolean test(int i, int size, ArrayList<Integer> digits){

        if(digits.get(size).equals(digits.get(i))){

            if(size == i || size - i == 1){
                return true;

            }else{
                //System.out.println("i: " + i + " size: " + size + " digits@i: " + digits.get(i) +" digits@size " + digits.get(i));
                size--;
                i++;
                return test(i, size, digits);
            }
        }
        return false;
    }
}