[Baekjoon Online Judge] 2210 - 숫자판 점프 / Java

https://www.acmicpc.net/problem/2210

2210번: 숫자판 점프

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {

	static int[] dr = { -1, 1, 0, 0 };
	static int[] dc = { 0, 0, -1, 1 };
	static int[][] map = new int[5][5];
	
	// HashSet 이용하여 중복 체크
	static Set<Integer> answerSet = new HashSet<>();

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;

		for (int i = 0; i < 5; i++) {
			st = new StringTokenizer(br.readLine());
			for (int j = 0; j < 5; j++) {
				map[i][j] = Integer.parseInt(st.nextToken());
			}
		}

		for (int i = 0; i < 5; i++) {
			for (int j = 0; j < 5; j++) {
				search(1, i, j, map[i][j]);
			}
		}

		System.out.println(answerSet.size());
	}

	private static void search(int cnt, int r, int c, int n) {
		
		// 6개 선택했을 경우
		if (cnt == 6) {
			answerSet.add(n);
			return;
		}

		for (int dir = 0; dir < 4; dir++) {
			int nr = r + dr[dir];
			int nc = c + dc[dir];

			if (nr >= 0 && nr < 5 && nc >= 0 && nc < 5) {
				search(cnt + 1, nr, nc, (n * 10) + map[nr][nc]);
			}
		}
	}
}