uploaded at 2023. 1. 23. 오후 2:43:16

2023-01-23 14:43:17 +09:00
parent 7da51981ea
commit 552f1cf9ab
1 changed files with 36 additions and 0 deletions
@@ -0,0 +1,36 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/43163
+
+class Solution {
+    static String tg;
+    static int tt;
+    public int solution(String begin, String target, String[] words) {
+        tt = 0;
+        tg = target;
+        boolean[] visit = new boolean[words.length];
+        dfs(begin, words, 0, visit);
+        return tt;
+    }
+    private void dfs(String from, String[] words, int depth, boolean[] visit){
+        int pos = 0;
+        if(!from.equals(tg)){
+            for(String word : words){
+                if(!visit[pos] && !from.equals(word) && diffCheck(from,word)) {
+                    visit[pos] = true;
+                    dfs(word, words, depth+1, visit);
+                    visit[pos] = false;
+                }
+                pos++;
+            }    
+        } else{
+            if(tt==0 || tt>depth) tt = depth;
+        }    
+    }
+    private boolean diffCheck(String first, String second){
+        int len = first.length(), cnt = 0;
+        for(int a = 0; a < len; a++){
+            if(first.charAt(a)!= second.charAt(a)) cnt ++;
+            if(cnt > 1) break;
+        }
+        return cnt == 1;
+    }
+}