[Algorithm/인프런] 격자판 최대합

import java.util.Scanner; public class testClass { public static void main(String[] args) { Scanner in=new Scanner(System.in); int num = in.nextInt(); int [][]arr = new int[num][num]; for(int i = 0 ; i < num; i++) { for(int j = 0 ; j < num; j++) { arr[i][j]=in.nextInt(); } } solution(arr); } public static void solution(int [][] num) { int lineMaxSum=0, rowMaxSum=0; int []lineSum = new int[num.le..

2023.07.11