题解 | #查找组成一个偶数最接近的两个素数#
查找组成一个偶数最接近的两个素数
https://www.nowcoder.com/practice/f8538f9ae3f1484fb137789dec6eedb9
看了一下，这题解法很多，我也写一下我的解法，思路是直接找到最小的差值，然后根据和差公式直接输出值
import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
// 记录最小的差值
int minDiffer = Integer.MAX_VALUE;
for (int i = 1; i < num; ++i) {
if (isPrime(i) && isPrime(num - i)) {
int differ = Math.abs(num - i - i);
minDiffer = Math.min(differ, minDiffer);
}
}
// 和差公式
System.out.println((num - minDiffer) / 2);
System.out.println((num + minDiffer) / 2);
}
public static boolean isPrime(int num) {
for (int i = 2; i <= Math.sqrt(num); ++i) {
if (num % i == 0) {
return false;
}
}
return true;
}
}
