4 Largest palindrome product - Project Eulder

Largest palindrome product

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

package xxx.xxx.xxx;


/*
 * A palindromic number reads the same both ways. 
 * The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
 * Find the largest palindrome made from the product of two 3-digit numbers.
 */
public class LargestPalindromeProduct {


private int compute() {
int x, y, z;
int palindrome = -1;
int min = 100 * 100;
int max = 999 * 999;
for (x = 9; x >= 1; x--) {
for (y = 9; y >= 0; y--) {
for (z = 9; z >= 0; z--) {
String str = String.valueOf(x) + String.valueOf(y)
+ String.valueOf(z) + String.valueOf(z)
+ String.valueOf(y) + String.valueOf(x);
palindrome = Integer.parseInt(str);
System.out.println(palindrome);
if (palindrome < max) {
for (int i = 100; i < 1000; i++) {
if (palindrome % i == 0 && ((palindrome/i)<1000) && ((palindrome/i)>= 100)) {
System.out.println("palindrome " + palindrome + "// i " + i);
return palindrome;
}
}


}


}
}
}
for (x = 9; x >= 1; x--) {
for (y = 9; y >= 0; y--) {
for (z = 9; z >= 0; z--) {
String str = String.valueOf(x) + String.valueOf(y)
+ String.valueOf(z) + String.valueOf(y) + String.valueOf(x);
palindrome = Integer.parseInt(str);
System.out.println(palindrome);
if (palindrome < max) {
for (int i = 100; i < 1000; i++) {
if (palindrome % i == 0 && ((palindrome/i)<1000) && ((palindrome/i)>= 100)) {
System.out.println("palindrome " + palindrome + "// i " + i);
return palindrome;
}
}


}


}
}
}



return palindrome;
}


private int compute2() {
int palindrome = -1;
int min = 100 * 100;
int max = 999 * 999;
for (int i = max; i > min; i--) {
String temp = String.valueOf(i);
// System.out.println(temp);
boolean isPalindrome = true;
for (int index = 0; index < temp.length() / 2; index++) {
// System.out.println(i);
if (temp.charAt(index) != (temp.charAt(temp.length() - index
- 1))) {
isPalindrome = false;
break;
}
}
if (isPalindrome) {
// System.out.println(i);
palindrome = i;
for (int divider = 999; divider >= 100; divider--) {
System.out.println(palindrome+"/"+divider+" ~ quotient "+palindrome/divider);
System.out.println(palindrome % divider );
System.out.println((palindrome/divider)<1000);
if (palindrome % divider == 0 && ((palindrome/divider)<1000) && ((palindrome/divider)>= 100)) {
System.out.println("palindrome " + palindrome + "// divider " + divider +"// quotient "+(palindrome/divider));
return palindrome;
}
}
}
}
return palindrome;
}


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
LargestPalindromeProduct largestPalindromeProduct = new LargestPalindromeProduct();
System.out.println(largestPalindromeProduct.compute());
}


}