Project Euler | Problem 4

public class Prob4 {
    private static String reverse(String arg) {
        String reversed = "";

        for (int i = arg.length() - 1; i >= 0; i--) reversed += arg.substring(i, i + 1);

        return reversed;
    }

    public static void main(String[ ] args) {
        int digits = 2, largest = 0;

        int limit = (int) Math.pow(10, digits);

        for (int a = limit; a > 0; a--) {
            if (a * limit < largest) break;

            for (int b = limit; b >= a; b--) {
                int prod = a * b;
                String prodStr = Integer.toString(prod);

                if (prodStr.equals(Prob4.reverse(prodStr))) {
                    largest = prod;
                    System.out.print(a);
                    System.out.print(" * ");
                    System.out.print(b);
                    System.out.print(" = ");
                    System.out.println(prod);
                }

                if (prod < largest) break;
            }
        }

        System.out.println(largest);
    }
}