Introduction to Java Programming编程题8.13<返回二维数组中最大值及下标>

/*
Enter the number of rows and columns of the array: 3 4
Enter the array: 
11 33.5 88.1 4
0 -2.2 -10.1 -20
1.11 2.22 3.3 4.4
The location of the largest element is 88.1 at (0, 2)
 */
import java.util.Scanner;

public class FindMaxValue {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        System.out.print("Enter the number of rows and columns of the array: ");
        final int ROW = input.nextInt();
        final int COLUMN = input.nextInt();
        double[][] matrix = new double[ROW][COLUMN];

        System.out.println("Enter the array: ");
        for (int i = 0, j; i < matrix.length; i++)
            for (j = 0; j < matrix[i].length; j++)
                matrix[i][j] = input.nextDouble();

        int[] max = findMax(matrix);
        System.out.println("The location of the largest element is " + matrix[max[0]][max[1]] + " at (" + max[0] + ", " + max[1] + ")");
    }

    public static int[] findMax(double[][] matrix) {
        int[] max = new int[2];
        int k = 0;
        double maxValue = matrix[k][k];

        for (int i = 0, j; i < matrix.length; i++) {
            for (j = 0; j < matrix[i].length - 1; j++)
                if (maxValue < matrix[i][j + 1]) {
                    max[k] = i;
                    max[k + 1] = j + 1;
            }
        }
        return max;
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值