从for循环中找到最大值

该答案在代码中描述为解决方案：

long highest_palindrome = 0L;int storeI = 0;int storeJ = 0;long product;outer: for (int i = 999; i >= 100; i--) {    for (int j = 999; j >= 100; j--) {        product = j * i;        if (product < highest_palindrome) break;        if (reverse(product)) { if (product > highest_palindrome) {     highest_palindrome = product;     storeI = i;     storeJ = j; } continue;        }    }}System.out.printf("%d * %d = %d%n", storeI, storeJ, highest_palindrome);