/**
* 题目:给你一个正整数n,假设有两个质数加起来等于n,问一共有多少组这样的质数?
* 思路:
* 1、我们得要先有一个函数去判断是否是质数
* 2、循环拆解为两个数,暴力拆解
*/
试下10-15分钟内做出来。
public class Leecode002 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入需要测试的数字:");
int n = sc.nextInt();
int count = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if(((i+j)==n)&&(isZhiShu(i)==true)&&(isZhiShu(j)==true)){
System.out.println("i的数值: "+i+" j的数值:"+j);
count++;
}
}
}
System.out.println("一共有 "+count+" 组质数");
}
public static Boolean isZhiShu(Integer num){
boolean flag = true;
if(num<=3){
flag = true;
}else{
for (int i = 2; i < num; i++) {
if(num%i == 0){
flag = false;
break;
}
}
}
return flag;
}
}
测试结果:
![](https://img-blog.csdnimg.cn/f79b5b3dede14408901f4aa1ce53e613.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5aWU6LeR55qE5omr5Zyw5YOn,size_15,color_FFFFFF,t_70,g_se,x_16)
![](https://img-blog.csdnimg.cn/4a1b7bcfdfd343e7a77abda5fe919f2d.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5aWU6LeR55qE5omr5Zyw5YOn,size_18,color_FFFFFF,t_70,g_se,x_16)
![](https://img-blog.csdnimg.cn/6b38f6e779d2451faf84823f87b5b955.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA5aWU6LeR55qE5omr5Zyw5YOn,size_17,color_FFFFFF,t_70,g_se,x_16)