[백준 알고리즘] 10809번 알파벳 찾기(Python 3, Java)

 

<Python 3>

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)))

 

<Java>

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 = new BufferedReader(new InputStreamReader(System.in));
        String line = br.readLine();
        int[] alpha = new int[26];
        Arrays.fill(alpha, -1);

        for (int i = 0; i < line.length(); i++)
            if(alpha[line.charAt(i) - 'a']==-1)
                alpha[line.charAt(i) - 'a'] = i;

        for(int num: alpha)
            System.out.print(num+" ");

    }
}

 

 

▼링크

https://www.acmicpc.net/problem/10809

10809번: 알파벳 찾기