HR자바 Java 2D Array

개요

HR자바 Java 2D Array

• https://www.hackerrank.com/challenges/java-2d-array/problem
• 참고: HR30 Day 11: 2D Arrays

해커랭크 Java

#	문제	비고
HR자바 Data Structures e
28	HR자바 Java 1D Array
29	HR자바 Java 2D Array
30	HR자바 Java Subarray
31	HR자바 Java Arraylist
32	HR자바 Java 1D Array (Part 2)
33	HR자바 Java List
34	HR자바 Java Map
35	HR자바 Java Stack
36	HR자바 Java Hashset
37	HR자바 Java Generics
38	HR자바 Java Comparator
39	HR자바 Java Sort
40	HR자바 Java Dequeue
41	HR자바 Java BitSet
42	HR자바 Java Priority Queue

---

Java

Copy

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {
    private static final Scanner scanner = new Scanner(System.in);
    public static void main(String[] args) {
        int[][] arr = new int[6][6];
        for (int i = 0; i < 6; i++) {
            String[] arrRowItems = scanner.nextLine().split(" ");
            scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
            for (int j = 0; j < 6; j++) {
                int arrItem = Integer.parseInt(arrRowItems[j]);
                arr[i][j] = arrItem;
            }
        }
        scanner.close();
        
        int sum;
        int max = -100;
        for(int i=1; i<5; i++) {
            for(int j=1; j<5; j++) {
                sum = arr[i-1][j-1] + arr[i-1][j] + arr[i-1][j+1]
                    + arr[i][j]
                    + arr[i+1][j-1] + arr[i+1][j] + arr[i+1][j+1];
                if( sum > max ) max = sum;
            }
        }
        System.out.println( max );
    }
}