java记——8.13**坑爹的缺省包
2015-11-04 19:06
381 查看
问题描述:
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.
程序代码:
运行结果:
心得体会:
天坑
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)
心得体会:
天坑
相关文章推荐
- java 记——课本例题,判断一个字符串是否是回文
- java记——统计一串字符中每个字母出现的个数
- java记——16进制数转换10 进制数
- java遍历父文件夹下所有文件
- 线程的概念以及线程的开启和创建
- 遍历Map
- Java【小考】
- Java【小考】
- 判断星期
- long转日期字符串
- SmartUpload 的乱码处理
- Java笔试题
- 字符串转日期
- java中判断字符串是否为数字的方法
- springmvc对同名参数处理-我们到底能走多远系列(44)
- java 读和写txt文件(不写入指定字符)
- 生产者/消费者问题的多种Java实现方式--转
- java---表、栈和队列
- 使用选项_JAVA_OPTIONS扩大jvm堆大小
- Java 7之集合类型 - 二叉排序树、平衡树、红黑树---转