Java语言程序设计与数据结构（基础篇）chapter9 9.13

最新推荐文章于 2024-10-06 20:29:51 发布

糖饼hc0422

最新推荐文章于 2024-10-06 20:29:51 发布

阅读量87

点赞数

分类专栏： Java语言程序设计与数据结构（基础篇）文章标签： java

本文为博主原创文章，未经博主本人许可，不得转载或用于其他用途。如有问题欢迎指正

本文链接：https://blog.csdn.net/weixin_51032985/article/details/116984607

版权

Java语言程序设计与数据结构（基础篇）专栏收录该内容

17 篇文章 2 订阅

订阅专栏

Location类

package com.sugarpie.classtest15;

/**
 * @author sugarpie
 * @create 2021-05-13-14:33
 */
public class Location {
    //存储二维数组最大值及其下标
    public int row;
    public int column;
    public double maxValue;

    public static Location locateLargest(double[][] a){
        Location location = new Location();
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                if (a[i][j] > location.maxValue){
                    location.maxValue = a[i][j];
                    location.row = i;
                    location.column = j;
                }
            }
        }
        return location;
    }
}

package com.sugarpie.classtest15;

import java.util.Scanner;

/**
 * @author sugarpie
 * @create 2021-05-13-14:37
 */
public class LocationTest {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter the number of rows and columns in the array:");
        int row = input.nextInt();
        int column = input.nextInt();
        double[][] arr = new double[row][column];
        System.out.println("Enter the array:");
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                arr[i][j] = input.nextDouble();
            }
        }
        Location largest = Location.locateLargest(arr);
        System.out.println("The location of the largest element is " + (int)largest.maxValue + " at (" + largest.row + "," + largest.column + ")");
    }
}

运行结果：