반응형
swea 스도쿠검증
-
[SW Expert Academy] 1974. 스도쿠 검증Algorithm/Source Code 2022. 7. 16. 01:48
solution.py def check(graph): for i in range(9): # 행 ck = [] for j in range(9): if ck: if graph[i][j] in ck: return '0' ck.append(graph[i][j]) for i in range(9): # 열 ck = [] for j in range(9): if ck: if graph[j][i] in ck: return '0' ck.append(graph[j][i]) for i in range(0,9,3): # 3*3 for j in range(0,9,3): ck = [] for n in range(3): for k in range(3): if ck: if graph[i+n][j+k] in ck: return '0' ..