概述
/* 输入: 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+" ) "); } }
最后
以上就是精明皮卡丘为你收集整理的java Location类的全部内容,希望文章能够帮你解决java Location类所遇到的程序开发问题。
如果觉得靠谱客网站的内容还不错,欢迎将靠谱客网站推荐给程序员好友。
本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
发表评论 取消回复