![[백준 알고리즘] 10809번 알파벳 찾기(Python 3, Java)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FYaUZD%2FbtqBWC3u7Fw%2FZD4xUmXgkubrnrE95yJWp1%2Fimg.png)
언어, 알고리즘 공부/백준2020. 2. 12. 15:35[백준 알고리즘] 10809번 알파벳 찾기(Python 3, Java)
word = input() alpha = [-1 for _ in range(26)] for i in range(len(word)): if alpha[ord(word[i]) - 97] == -1: alpha[ord(word[i]) - 97] = i else: pass print(" ".join(map(str, alpha))) import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; public class Main { public static void main(String[] args) throws IOException { BufferedReader br ..