Question

（JAVA）建立一个m行n列的矩阵，找出其中最小值的元素所有的行和列，输出其值和所在行所在列！

Answer 1

现在假设你有个M行N列已初始化的而为数组array[m][n]。我帮你写找出最小值和位置的算法。int x = 0,y = 0,reset = array[0][0];for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ if(reset>array[i][j]){ reset = array[i][j]; x = i; y = j } }}System.out.println("最小值是:"+reset);System.out.println("最小值位置在第"+x+"行，第"+y+"列");

Answer 2

import java.util.Date;
import java.util.Random;

public class Test {

public static void main(String[] a) {
// 生成一个7X7的矩阵
int[][] nums = new int[7][7];

// 添加数据
Random random = new Random(new Date().getTime());
for (int i = 0; i < 7; i++) {
for (int j = 0; j < 7; j++) {
nums[i][j] = random.nextInt(100);
}
}

// 输出所有的矩阵元素
for (int i = 0; i < 7; i++) {
for (int j = 0; j < 7; j++) {
System.out.print(nums[i][j]);
System.out.print(',');
}
System.out.println();
}

int colum=0;
int row = 0;
for (int i = 0; i < 7; i++) {
for (int j = 0; j < 6; j++) {
if (nums[0][0] > nums[i][j + 1]) {//如果第一元素大于下面一个元素 将下面一个元素的值赋给第一个元素
nums[0][0] = nums[i][j + 1];
colum = i;
row = j+1;
}
}
}
System.out.println(colum);
System.out.println(row);
System.out.println("值为"+nums[0][0]);
}
}

Answer 3

public class FindMin { /* * 生成二维数组，存入0-100随机数 */ public int[][] getArray(int m,int n){ int[][] ii=new int[m][n]; for (int i = 0; i < ii.length; i++) { for (int j = 0; j < ii[i].length; j++) { ii[i][j]= (int)(Math.random()*100); } } return ii; } public void printArray(int[][] ii){ for (int i = 0; i < ii.length; i++) { for (int j = 0; j < ii[i].length; j++) { System.out.print(ii[i][j]+" "); } System.out.println(); } } public void findMin(int[][] ii){ int tmp=0; int x=0; int y=0; for (int i = 0; i < ii.length; i++) { for (int j = 0; j < ii[i].length; j++) { if(i==0&&j==0){ tmp=ii[i][j]; x=i; y=j; } if(tmp>ii[i][j]){ tmp=ii[i][j]; x=i; y=j; } } } System.out.println("min num :"+tmp); System.out.println("row:"+x); System.out.println("col:"+y); } public static void main(String[] args) { FindMin f=new FindMin(); int[][] ii=f.getArray(3, 3); f.printArray(ii); f.findMin(ii); }
}