개미의 개열시미 프로그래밍

[자바 풀이] import java.util.*; import java.io.*; class Solution { static int[][] graph = {{1,2,3}, {4,5,6}, {7,8,9}, {-1, 0, -2}}; static int[][] visited; static Queue q; static int[] dy = {-1, 1, 0, 0}; static int[] dx = {0, 0, -1, 1}; public String solution(int[] numbers, String hand) { StringBuilder sb = new StringBuilder(numbers.length); List result = new ArrayList(); int curL = -1; int curR = ..