Algorithm/BFS, DFS
[백준] 10809번 알파벳 찾기
등촌동 꼬북이
2020. 9. 4. 16:08
쉬운 문제
ans = [ -1 for i in range(26) ]
x = input()
for i in range(len(x)):
if ans[ord(x[i])- 97] == -1:
ans[ord(x[i])- 97] = i
for i in range(len(ans)):
print(ans[i], end=' ')