COS PRO 1급 JAVA 비숍으로부터 도망쳐

 

 

[소스 코드]

import java.util.*;

class Main {
		int[] dx = {-1,1,-1,1};
		int[] dy = {1,1,-1,-1}; 
    public int solution(String[] bishops) {
        int answer = 0;
				boolean[][] visit = new boolean[8][8];
				for(int i=0;i<bishops.length;i++){
					int x = bishops[i].charAt(0) - 'A';
					int y = bishops[i].charAt(1) - '1';
					visit[x][y] = true;
					for(int d=0;d<4;d++){
						int nx = x + dx[d];
						int ny = y + dy[d];
						while(nx>=0 && nx<8 && ny>=0 && ny<8){
							visit[nx][ny] = true;
							nx += dx[d];
							ny += dy[d];
						}
					}
				}
				for(int i=0;i<8;i++){
					for(int j=0;j<8;j++){
						if(!visit[i][j]) answer++;
					}
				}
        return answer;
    }
}