TopCoder SRM 507 Division 2 - 250 point problem

CubeAnts.java

import java.util.ArrayList;
import java.util.List;

public class CubeAnts {
    public int getMinimumSteps(int[] pos) {
        List<Integer> l = new ArrayList<Integer>();
        for (int i : pos) l.add(i);
        if (l.contains(6)) return 3;
        else if (l.contains(2) || l.contains(5) || l.contains(7)) return 2;
        else if (l.contains(3) || l.contains(1) || l.contains(4)) return 1;
        return 0;
    }
}