Largest palindrome multiple of two three digit numbers
public class LargestPamildromeof3Digits {
public static int reverse(int n) {
int num = 0;
int size = String.valueOf(n).length() - 1;
while (n > 0) {
num += (n % 10) * (int)Math.pow(10, size--);
n /= 10;
}
return num;
}
public static boolean isPalindrome(int n) {
if (n == reverse(n))
return true;
else
return false;
}
public static void main(String[] args) {
java.util.ArrayList<Integer> list = new java.util.ArrayList<Integer>();
for (int i = 100; i <= 999; i++) {
for (int j = 100; j <= 999; j++) {
int prod = i * j;
if (isPalindrome(prod))
list.add(new Integer(prod));
}
}
java.util.Collections.sort(list);
//System.out.println(list.get(list.size() - 1));
javax.swing.JOptionPane.showMessageDialog(null, list.get(list.size() - 1));
}
}
public static int reverse(int n) {
int num = 0;
int size = String.valueOf(n).length() - 1;
while (n > 0) {
num += (n % 10) * (int)Math.pow(10, size--);
n /= 10;
}
return num;
}
public static boolean isPalindrome(int n) {
if (n == reverse(n))
return true;
else
return false;
}
public static void main(String[] args) {
java.util.ArrayList<Integer> list = new java.util.ArrayList<Integer>();
for (int i = 100; i <= 999; i++) {
for (int j = 100; j <= 999; j++) {
int prod = i * j;
if (isPalindrome(prod))
list.add(new Integer(prod));
}
}
java.util.Collections.sort(list);
//System.out.println(list.get(list.size() - 1));
javax.swing.JOptionPane.showMessageDialog(null, list.get(list.size() - 1));
}
}
Comments
Post a Comment
Post Your Valuable Comments