asked
Introduction to Python Algorithm Problem Solving (Coding Test Preparation)
8. Finding Permutations (DFS)
Written on
·
191
1
for i in range(1, n+1): if not i in res: res[L] = i DFS(L+1) res[L] = 0
Answer 1
0
안녕하세요^^
네. 체크로 하는게 좋습니다.