forked from alexako/ProjectEuler
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem04.java
More file actions
59 lines (48 loc) · 1.64 KB
/
Copy pathproblem04.java
File metadata and controls
59 lines (48 loc) · 1.64 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/*
* problem04.java
*
* Copyright 2013 Alex <alex@kludge>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA.
*
*
*/
public class problem04 {
public static boolean isPalindrome(Integer num) {
String str = new Integer(num).toString();
String rev = new StringBuilder(str).reverse().toString();
if (str.compareTo(rev) == 0) {
System.out.println(num + " is a palindrome!");
return true;
}
// System.out.println(num + " is not a palindrome!");
return false;
}
public static void main (String args[]) {
Integer product = 1, max = 0;
for (int i = 100; i < 1000; i++) {
for (int j = 100; j < 1000; j++) {
product = i * j;
if (isPalindrome(product)) {
if (max < product) {
max = product;
}
}
}
}
System.out.println("Max: " + max);
}
}