java Location类

/*
输入:
Enter te numbeer of rows and columns in the array:
    3 4
    Enter the array:
    23.5 35 2 10 4.5 3 45 3.5 35 44 5.5 9.6
 输出:  The location of the largest element is 45.0 at (1 ,2 )
*/
public class Location {
    int row;
    int column;
    double maxValue;
    public Location(){

    }
    public static Location locationLargest(double[][] a){
        Location l1 = new Location();
        l1.maxValue = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length ; j++) {
                if(a[i][j] > l1.maxValue){
                    l1.maxValue = a[i][j];
                    l1.row = i;
                    l1.column = j;
                }
            }
        }
        return l1;
    }
}
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.println("Enter te numbeer of rows and columns in the array:");
        int row = input.nextInt();
        int column = input.nextInt();
        double[][] str = new double[row][column];
        System.out.println("Enter the array:");
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                str[i][j] = input.nextDouble();
            }
        }
        Location l1 = Location.locationLargest(str);
        System.out.println("The location of the largest element is "+ l1.maxValue+" at "+ "("+l1.row+" ,"+l1.column+" ) ");
    }

}
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值