package halou; import java.util.ArrayList; import java.util.Scanner; public class Chachacha { public static void main(String[] args) { ArrayList<int[]> list = new ArrayList<>(); int a[]=null; Scanner scanner = new Scanner(System.in); System.out.println("你需要的阶数"); int n=scanner.nextInt(); System.out.println("数字"); int[][] array=new int[n][n]; for (int i=0;i<n;i++){ for (int j=0;j<n;j++){ array[i][j]=scanner.nextInt(); } } System.out.println("你需要的数字"); int b= scanner.nextInt(); for (int i=0;i<n;i++){ for (int j=0;j<n;j++){ if (array[i][j]==b){ a=new int [2]; a[0]=i; a[1]=j; list.add(a); } } } haha(list); } public static void haha(ArrayList<int []> list){ int length=list.size(),x,y,x1,y1; ArrayList<int []> list1 = new ArrayList<>(); for(int i=0;i<length;i++){ int[] ints = list.get(i); x = ints[0]; y = ints[1]; for (int j=i+1;j<length;j++){ int[] ints1 = list.get(j); x1=ints1[0]; y1=ints1[1]; if ( fafa(x,x1)==0&&fafa(y,y1)==1||fafa(x,x1)==1&&fafa(y,y1)==0){ if(!list1.contains(ints)) { list1.add(ints); }if (!list1.contains(ints1)) list1.add(ints1); } } } int size = list1.size(); for (int i=0;i<size;i++){ int i1 = list1.get(i)[0]; int i2 = list1.get(i)[1]; System.out.println("矩阵第"+i1+"行第"+i2+"列可组成"); } } public static int fafa(int x,int y) { int z = x - y; return Math.abs(z); } }
java 编程个人突破3
最新推荐文章于 2022-10-01 19:26:36 发布