import java.util.ArrayList; import java.util.Scanner; public class maxRowAndColumn { public static void main(String[] args) { showArray(input()); } public static int[][] input() { System.out.print("Enter the array size n: "); Scanner input = new Scanner(System.in); int n = input.nextInt(); int[][] array = new int[n][n]; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) array[i][j] = (int) (Math.random() * 1000000) % 2; return array; } public static void showArray(int[][] array) { System.out.println("The random array is"); for (int i = 0; i < array.length; i++) { for (int j = 0; j < array[i].length; j++) System.out.print(array[i][j]); System.out.println(); } ArrayList<Integer> listRow = new ArrayList<>(); ArrayList<Integer> listColumn = new ArrayList<>(); int maxRow = 0, maxColumn = 0, i; for (i = 0; i < array.length; i++) { if (maxRow < sumOfRow(array, i)) maxRow = sumOfRow(array, i); if (maxColumn < sumOfColumn(array, i)) maxColumn = sumOfColumn(array, i); } for (i = 0; i < array.length; i++) { if (sumOfRow(array, i) == maxRow) listRow.add(i); if (sumOfColumn(array, i) == maxColumn) listColumn.add(i); } System.out.print("The largest row index: "); for (i = 0; i < listRow.size(); i++) { if (i < listRow.size() - 1) System.out.print(listRow.get(i) + ", "); else System.out.println(listRow.get(i)); } System.out.print("The largest column index: "); for (i = 0; i < listColumn.size(); i++) { if (i < listColumn.size() - 1) System.out.print(listColumn.get(i) + ", "); else System.out.println(listColumn.get(i)); } } public static int sumOfRow(int[][] array, int i) { int sum = 0; for (int j = 0; j < array[i].length; j++) sum += array[i][j]; return sum; } public static int sumOfColumn(int[][] array, int j) { int sum = 0; for (int i = 0; i < array.length; i++) sum += array[i][j]; return sum; } }
Java语言程序设计11.9最大的行和列
最新推荐文章于 2024-07-09 16:17:35 发布