8.13**

import java.util.Scanner;

public class h
{


	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		System.out.print("Enter the number of rows and colums of the array :");
		Scanner input = new Scanner(System.in);
		int row = input.nextInt();
		int column = input.nextInt();
		System.out.println("Enter the array: ");
		double[][] a = new double[row][column];
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < column; j++)
			{
				a[i][j] = input.nextDouble();
			}
		}
		Location location = new Location();
		Location.locateLargest(a);
		System.out.println("The location of the largest is "+ location.getMax() + " at (" + location.getRow() + " , "+ location.getColumn() + ")");
	}

}
class Location
{
	private static int row;
	private static int column;
	private static double max;

	public int getRow()
	{
		return row;
	}



	public int getColumn()
	{
		return column;
	}


	public double getMax()
	{
		return max;
	}

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


}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值