java记——8.13**坑爹的缺省包

问题描述:

Design a class named Location for location a maximal value and its location in a two-dimensional array,The class contains public data fields row,column,and maxValue that store the maximal value and its indices in a two dimensional array with row and column as int type and maxValue as double type.

Write the following method that returns the location of the largest element in a two-dimensional array.
public static Location locateLargest(double[][] a)
The return value is an instance of Location.Write a test program that prompts the user to enter a two-dimensional array and displays the location of the largest element in the array.

程序代码:

import java.util.Scanner;
public class Lll {
	public static void main(String[] args){
		System.out.println("Enter the number of rows and column columns of the array:");
		Scanner input=new Scanner(System.in);
		int row=input.nextInt();
		int column=input.nextInt();
		double[][] a=new double[row][column];
		System.out.println("Enter the array:");
		for(int i=0;i<row;i++){
			for(int j=0;j<column;j++){
				a[i][j]=input.nextDouble();
			}
		}
		Location location=new Location();
		Location.Locationlargest(a);
		System.out.println("The location of the largest element is  "+location.setmax()+" at ("+location.setrow()+", "+location.setcolumn()+")");
		
	}
static class Location{
	public static int row;
	public static int column;
	public static double max;
	int setrow(){
		return row;
	}
	int setcolumn(){
		return column;
	}
	double setmax(){
		return max;
	}
	public static Location Locationlargest(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;
	}
}
}


运行结果:

Enter the number of rows and column columns of the array:

3 3
Enter the array:
1 2 1
0 0 0
0 0 0
The location of the largest element is  2.0 at (0, 1)


心得体会:

天坑

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值