[SW Expert Academy] 1209. Sum- Java

[SWEA] 1209. [S/W 문제해결 기본] 2일 차 - Sum 

 

 

문제

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13_BWKACUCFAYh&categoryId=AV13_BWKACUCFAYh&categoryType=CODE

 

 

문제풀이

 

 

전체소스                                           

import java.util.*;

public class Solution
{
    public static int nums[][] = new int[100][100];
    public static int max= -1;
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        
        for(int t=1; t<=10; t++)
        {
            int tc = sc.nextInt();
            
            //배열 입력
            for(int i=0; i<100; i++)
            {
                for(int j=0; j<100; j++)
                {
                    nums[i][j] = sc.nextInt();
                }
            }
            //max값 계산
            int result = calMax();
            //출력
            System.out.println("#" + tc + " " + result);
        }
    }
    
    public static int calMax()
    {
        max = -1;
        int dig1 =0, dig2 =0;	//대각선값 1,2
        for(int i=0; i<100; i++)
        {
            int row=0, col=0;
            for(int j=0; j<100; j++)
            {
                row += nums[i][j];
                col  += nums[j][i];
				
                if( i==j ) dig1 += nums[i][j];
                else if( i+j == 99) dig2 += nums[i][j];
            }
            int temp  = ( row>= col ) ? row : col;
            max = (max >= temp) ? max : temp;
        }
        int temp2 = (dig1 >= dig2) ? dig1 : dig2;
        max =  (max >= temp2) ? max : temp2;
        
        return max;
    }
}