We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 125f3dc commit 35bce3eCopy full SHA for 35bce3e
[211206] 단어 변환/YooRiChae.py
@@ -0,0 +1,31 @@
1
+import difflib
2
+
3
+def solution(begin, target, words):
4
+ answer = []
5
+ visited = [0*i for i in range(len(words))]
6
7
+ def dfs(now,visited):
8
+ for i, w in enumerate(words):
9
+ diff = d.compare(now, w)
10
+ if len(list(diff)) - len(now) == 1 and visited[i]==0:
11
+ visited[i] = 1
12
+ if w == target:
13
+ answer.append(visited.count(1))
14
+ else:
15
+ dfs(w, visited)
16
+ visited[i] = 0
17
18
+ d = difflib.Differ()
19
+ dfs(begin, visited)
20
+ if not answer:
21
+ return 0
22
+ return min(answer)
23
24
+'''
25
+정확성 테스트
26
+테스트 1 〉 통과 (0.12ms, 10.4MB)
27
+테스트 2 〉 통과 (10.93ms, 10.4MB)
28
+테스트 3 〉 통과 (28.37ms, 10.4MB)
29
+테스트 4 〉 통과 (0.29ms, 10.4MB)
30
+테스트 5 〉 통과 (0.05ms, 10.5MB)
31
0 commit comments