문제해결전략 : BOGGLE (Java)
문제해결전략1 : 150p : BOGGLE -> recursion(brute force) package algospot; import java.io.*; public class Boggle { public static char[][] map; public static int[] dy = {-1, -1, 0, 1, 1, 1, 0, -1}; public static int[] dx = {0, 1, 1, 1, 0, -1, -1, -1}; public static boolean inRange(int y, int x) { if(y =5 || x >=5) return false; return true; } public static boolean hasWord(int y, int x..
2022. 3. 6.