Project Euler: Problem 4

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15

int number1;
int number2;
int highest = 0;
int temp;
for (number1=100; number1<999; number1++) {
	for (number2=100; number2<999; number2++) {
		temp = number1*number2;
		if (Integer.toString(temp).equals(new StringBuffer(Integer.toString(temp)).reverse().toString())) {
			if (temp>highest) {
			highest = temp;
			System.out.println(number1 + " * " + number2 + " = " + highest);
			}
		}
	}
}