package com.company;import java.util.ArrayList; import java.util.Scanner;public class Main {public static void main(String[] args) {// write your code hereScanner sc=new Scanner(System.in);int N=sc.nextInt();int[] num=new int[N];//N以?xún)?nèi)的所有數(shù)int i;ArrayList sushu=new ArrayList();sushu.add(2);//將N以?xún)?nèi)所有數(shù)存入數(shù)組,獲取素?cái)?shù)，并存入sushu中for (i=0;i<N;i++){num[i]=i+1;if (num[i]>2){for (int j=2;j<num[i]-1;j++) {if (num[i] % j != 0) {}else {break;}if (j==num[i]-1){sushu.add(num[i]);}}}}int count=0;for (int k=1;k<sushu.size();k++){if(Integer.parseInt(sushu.get(k).toString())-Integer.parseInt(sushu.get(k-1).toString())==2){count++;}}System.out.println(count);} }

提示超時(shí)扣兩分，這就很難受，難道還要優(yōu)化？

package com.company;import java.util.ArrayList;import java.util.Scanner;public class Main {public static void main(String[] args) {// write your code hereScanner sc=new Scanner(System.in);int N=sc.nextInt();int[] num=new int[N];//N以?xún)?nèi)的所有數(shù)int i;ArrayList sushu=new ArrayList();sushu.add(2);sushu.add(3);//將N以?xún)?nèi)所有數(shù)存入數(shù)組,獲取素?cái)?shù)，并存入sushu中for (i=0;i<N;i++){num[i]=i+1;if (num[i]>2){for (int j=2;j<=Math.sqrt(num[i]);j++) {if (num[i] % j != 0) {}else {break;}if (j==(int)Math.sqrt(num[i])){sushu.add(num[i]);}}}}int count=0;for (int k=1;k<sushu.size();k++){if(Integer.parseInt(sushu.get(k).toString())-Integer.parseInt(sushu.get(k-1).toString())==2){count++;}}System.out.println(count);} }

內(nèi)循環(huán)結(jié)束條件改成j<=Math.sqrt(num[i])，并沒(méi)有改變超時(shí)的情況。

package com.company;import java.util.ArrayList; import java.util.Scanner;public class Main {public static void main(String[] args) {// write your code hereScanner sc = new Scanner(System.in);int N = sc.nextInt();int i, j, k = 0;int q = 1;int number = 0;int flag = 1;int[] A = new int[N];int[] B = new int[N];B[0]=2;for (i = 3; i <= N; i++) {A[k++] = i;}for (int m = 0; m < k; m++) {for (j = 2; j <= Math.sqrt(A[m]); j++) {if (A[m] % j == 0) {flag = 0;break;} else {flag = 1;}}if (flag == 1) {B[q++] = A[m];flag = 1;}}for (i = 0; i<q-1; i++){if (B[i + 1] - B[i] == 2) {number++;}}System.out.println(number);} }

腦殼疼，掙了兩分，告辭

轉(zhuǎn)載于:https://www.cnblogs.com/zhuzehua/p/9706276.html

總結(jié)

以上是生活随笔為你收集整理的1007的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。