Time Limit: 1s
Memory Limit: 128MB
2차 배열 안에서 가장 큰 값을 찾아내는 Generic 메소드를 작성하시오.
(Maximum element in a two-dimensional array) Write a generic method that returns the maximum element in a two-dimensional array.
* Line 1 : 자료형 (String, Integer, Double 중 하나)
* Line 2 : 행의개수N 열의개수M (N, M은 1~1,000범위의 정수)
* Line 3 ~ N+2 : 공백으로 구분된 M개의 값
* Line 1 : 가장 큰 값
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String type = sc.next(); int N = sc.nextInt(); int M = sc.nextInt(); if (type.compareTo("String") == 0) { String[][] arr1 = new String[N][M]; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) arr1[i][j] = sc.next(); System.out.println(max(arr1)); } else if (type.compareTo("Integer") == 0) { Integer[][] arr1 = new Integer[N][M]; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) arr1[i][j] = sc.nextInt(); System.out.println(max(arr1)); } else if (type.compareTo("Double") == 0) { Double[][] arr1 = new Double[N][M]; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) arr1[i][j] = sc.nextDouble(); System.out.println(max(arr1)); } } YOUR_CODE }
Integer 3 3 5 2 3 2 4 3 3 4 5
5
public static <E extends Comparable<E>> E max(E[][] list)
JAVA2015 PE19.6