java给定一个二维整数数组,找出其中的质数 *筛选法求质数：输入一个整数n，求小于这个整数的所有质数。(...
\u6025\uff01\uff01\uff01java\u4f5c\u4e1a\uff0c\u7528\u4ece\u547d\u4ee4\u884c\u8f93\u5165\u6574\u6570\u7684\u65b9\u5f0f\uff0c\u5199\u4e00\u4e2a\u67e5\u627e\u6307\u5b9a\u6574\u6570\u8303\u56f4\u5185\u7684\u6240\u6709\u7d20\u6570\u7684\u7a0b\u5e8f\uff08\u7528\u6570\u7ec4\uff09\u6211\u73b0\u5728\u5728\u5916\u5934\uff0c\u4e0d\u597d\u610f\u601d
public class FindPrime
{
boolean Sign[];
int num[];
int n1;
FindPrime(int n)
{
this.Sign=new boolean[n];
this.num=new int[n];
for(int i=1;i<n;i++)
{
this.num[i-1]=i;
this.Sign[i-1]=true;
}
this.Sign[0]=false;
this.n1=n;
}
void f_prime()
{
int temp;
for(int i=2;i<this.n1;i++)
{
if(this.Sign[i-1]==true)
{
temp=i;
for(int j=i+temp;j<this.n1;j=j+temp)
{
this.Sign[j-1]=false;
}
}
}
}
}
\u6ce8\u91ca\u5c31\u4e0d\u5199\u4e86\u5427\uff0c\u633a\u7b80\u5355\u7684\uff0c\u6709\u4e0d\u61c2\u7684\u5730\u65b9\u53ef\u4ee5\u95ee\u6211
public class PrimeNumber {
public static void main(String[] args) {
int[][] a=new int[][]{{7,12,4,9,6},{3,9,6,47,54}}; //新建二维数组
//用两个循环来遍历二维数组
for(int i=0;i<2;i++){//数组有两行
for(int j=0;j<5;j++){//数组有5列
if (isPrime(a[i][j])) {// 调用isPrime()方法判断数组的元素是否是质数
System.out.println(a[i][j]);// 若isPrime()方法返回true,输出是素数
}
}
}
}
/**
* <pre>
* 用于判断一个数是否为素数，若为素数，返回true,否则返回false
* </pre>
*
* @param a
* 输入的值
* @return true、false
*/
public static boolean isPrime(int a) {
boolean flag = true;
if (a < 2) {// 素数不小于2
return false;
} else {
for (int i = 2; i <= Math.sqrt(a); i++) {
if (a % i == 0) {// 若能被整除，则说明不是素数，返回false
flag = false;
break;// 跳出循环
}
}
}
return flag;
}
}
public static void main(String[]args){
int [][] numbers = {
{7,12,4,9,6,3,9},
{2,6,3,54,2,56,21,33}
};
for(int i=0;i<numbers.length;i++){
for(int j=0;j<numbers[i].length;j++){
if(isPrime(numbers[i][j])){
System.out.println(numbers[i][j]);
}
}
}
}
public static boolean isPrime(int n){
for(int i=2;i<n;i++){
if(n%i==0){
return false;
}
}
if(n==1){
return false;
}
return true;
}
绛旓細涔﹀啓瀹屾瘯锛岄噰绾冲嵆鍙俰mport java.util.Arrays;import java.util.Comparator;import java.util.Scanner;public class YuGiOh{/** * 鏁扮粍鏁版嵁閮戒负涓1-11鐨勯殢鏈烘暟 */private static final int RANDOM = 11;private static final String SEP = " ";private static final String EXIT = "x";private ...
绛旓細1銆侀鍏堟墦寮Eclipse銆2銆佹柊寤涓涓鏂扮殑Java宸ョ▼銆3銆佹柊寤轰竴涓狤xample8绫绘枃浠躲4銆佸垱寤2缁存暟缁勩5銆佸垱寤轰竴涓緭鍑2缁存暟缁勭殑鍑芥暟銆6銆侀亶鍘鏁扮粍锛杈撳嚭鏁扮粍鍏冪礌銆7銆佽緭鍑2缁存暟缁勩8銆佽繍琛岀▼搴忕湅鐪嬭鍒椾簰鎹
绛旓細绗竴绉嶏紝鍏堝０鏄庡啀鍒嗛厤鍐呭瓨鐨勬柟寮 鏁扮粍澹版槑锛 鏁版嵁绫诲瀷 鏁扮粍鍚峓][];鍐呭瓨鍒嗛厤锛 鏁扮粍鍚 = new 鏁版嵁绫诲瀷[琛岀殑涓暟][鍒楃殑涓暟];涓句緥锛 鍋囧鎴戜滑闇瑕佺粺璁涓涓璞℃涓婃斁鐨勬槸榛戞杩樻槸鐧芥銆傝繖鏃讹紝鎴戜滑鍙互寤虹珛涓涓潗鏍囷紝鍗充互璞℃鐩樼殑涓よ竟寤虹珛鍧愭爣杞淬傝繖鏃讹紝鎴戜滑鍙互杩欐牱瀹氫箟杩欎釜浜岀淮鏁扮粍锛氬０鏄...
绛旓細int a []= new int[12];Scanner input =new Scanner(System.in);for(int i=0;i<12;i++){ a[i]=input.nextInt();system.out.print(a[i]);}
绛旓細闇姹傦細Java缂栫▼,鍒涘缓涓涓簩缁存暟缁,闅忔満浜х敓 0锝100涔嬮棿鐨勫,姹傚嚭鏈澶у煎強瀵瑰簲涓嬫爣銆傚垎鏋愭楠わ細A锛氬垱寤轰竴涓簩缁存暟缁 int[][] twoArr = new int[8][8];B: 闅忔満浜х敓0~100涔嬮棿鐨勫 Random random=new Random();random.nextInt(100);C:灏嗛殢鏈轰骇鐢熺殑鍊艰祴鍊肩粰鏁扮粍鍏冪礌 杩愮敤for寰幆 D锛氭眰鍑烘渶澶...
绛旓細package com.pzr.demo;import java.util.Arrays;public class Demo6 { public static void main(String[] args) { int[][] data = new int[2][3]; //璧嬪 for(int i = 0 ; i < 2 ; i++){ for(int j =0 ; j<3 ;j++){ data[i][j] = (int) (Math....
绛旓細浜岀淮鏁扮粍鍙互鐪嬫垚涓涓〃鏍锛屼竴涓琛ㄦ牸鍙互鏈変换鎰忚鍜屽垪 {1,2,3},{4,5,6},{7,8,9}琛ㄧず琛ㄦ牸鐨勮锛屼笉鏄簩缁村氨鍙湁2琛岋紝鍙互浠绘剰琛 1,4,7琛ㄧず绗竴鍒楋紝2锛5锛8琛ㄧず绗簩鍒楋紝3锛6锛9琛ㄧず绗笁鍒 閫氳繃琛屽拰鍒楀氨鍙互鑾峰緱璇ヤ綅缃殑鍏冪礌锛屾瘮濡傜涓夎绗簩鍒楀厓绱燼[2][1]鐨勫兼槸8锛堜笅鏍囨槸浠0寮濮...
绛旓細import java.util.Random;public class test { public static void main(String[] args) { Random r = new Random();int [] [] num = new int [4] [4];for(int n=0;n<4;n++){ for(int m=0;m<4;m++){ num[n][m]=r.nextInt(9);} } printN(num);//妫楠鏁扮粍绗涓涓鏁...
绛旓細閭ｆ槸琛屽拰鍒楃殑鎰忔,渚嬪: int[][] a = new int[3][5]; //涔熷氨鏄寤虹珛涓涓3琛5鍒楃殑浜岀淮鏁扮粍 浣犲ぇ姒傛病寮勬槑鐧java鏁扮粍瀹氫箟,澶氱湅鐪嬩功,java涓瀹為檯涓婃病鏈夊缁存暟缁勭殑姒傚康銆傚彧鏈変竴缁存暟缁勩傚缁存暟缁勫疄闄呬笂鏄竴缁存暟缁勭殑鏁扮粍銆傝繖鍜宑++涓殑澶氱淮鏁扮粍姒傚康鏄笉鍚岀殑銆 涓句釜渚嬪瓙锛歩nt[][] int1=n...
绛旓細import java.util.Random;public class T {public static void main(String[] args) {Random r = new Random();int a[][] = new int [4][4];for (int i=0;i<4;i++)for (int j=0;j<4;j++)a[i][j] = r.nextInt(99)+1;}} ...
