[SWEA-D3] 1206. View

▶문제설명

[SWEA] 1206. View

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

▶Solution

---

import java.util.*;
 
class Solution{
    
    public static void main(String args[]) throws Exception{
        int T = 1;
        int W = 0;
        int H = 0;
        int[] HArr = new int[1000];
        Scanner sc = new Scanner(System.in);
        while(T<=10)
        {
            int[][] arr = new int [257][1000];
            W = sc.nextInt();
            for(int col = 0 ; col<W ; col++){
                H = sc.nextInt();
                HArr[col]=H;
                for(int row = 0 ; row<H ; row++){
                    arr[row][col] = 1;
                }
            }
            int answer = 0;
            for(int col = 2 ; col<W-2 ; col++){
                for(int row = 0 ; row<HArr[col] ; row++){
                    boolean checkview = checkView(arr ,row, col);
                    if(checkview){
                        answer++;
                    }
                }
            }
            //System.out.println(Arrays.deepToString(arr));
             System.out.printf("#%d %d\n",T, answer);
            T++;
        }
    }
    public static boolean checkView(int[][] arr, int row, int col){
        if(arr[row][col+1] == 0 && arr[row][col+2] == 0
           && arr[row][col-1] == 0 && arr[row][col-2] == 0){
            return true;
        }
        return false;
    }
 
}