forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
p052.java
39 lines (30 loc) · 819 Bytes
/
p052.java
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
/*
* Solution to Project Euler problem 52
* By Nayuki Minase
*
* http://nayuki.eigenstate.org/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
import java.util.Arrays;
public final class p052 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p052().run());
}
public String run() {
outer:
for (int i = 1; ; i++) {
for (int j = 2; j < 6; j++) {
if (!hasSameDigits(i * j, i * (j + 1)))
continue outer;
}
return Integer.toString(i);
}
}
private static boolean hasSameDigits(int x, int y) {
char[] xdigits = Integer.toString(x).toCharArray();
char[] ydigits = Integer.toString(y).toCharArray();
Arrays.sort(xdigits);
Arrays.sort(ydigits);
return Arrays.equals(xdigits, ydigits);
}
}