/
PrimePalindrome.java
56 lines (52 loc) · 1.08 KB
/
PrimePalindrome.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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/**
* Prime Palindrome
* ------------------
* @author adambose1990
*
* CHALLENGE DESCRIPTION:
* Write a program which determines the largest prime palindrome less than 1000.
*
* INPUT SAMPLE:
* There is no input for this program.
*
* OUTPUT SAMPLE:
* Print to stdout the largest prime palindrome less than 1000.
* 929
*/
package com.codeeval.easy;
public class PrimePalindrome {
public static void main(String[] args) {
int num = 1000;
boolean yes = true;
while (yes) {
if (isPalindrome(num)) {
if (isPrime(num)) {
System.out.println(num);
yes = false;
}
}
num--;
}
}
private static boolean isPrime(int num) {
boolean prime = true;
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
prime = false;
break;
}
}
return prime;
}
private static boolean isPalindrome(int num) {
String strNum = Integer.toString(num);
boolean palin = true;
for (int i = 0; i < strNum.length() / 2; i++) {
if (strNum.charAt(i) != strNum.charAt(strNum.length() - 1 - i)) {
palin = false;
break;
}
}
return palin;
}
}