package SearchAlphabat;
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
int[] arrayI = new int[26];
for (int i = 0; i < 26; i++) {
arrayI[i] = -1;
}
Scanner scanner = new Scanner(System.in);
String S = scanner.nextLine();
char[] arrayChar = S.toCharArray();
for (int i = 0; i < S.length(); i++) {
if (arrayI[Integer.parseInt(String.valueOf(arrayChar[i] - 'a'))] == -1) {
arrayI[Integer.parseInt(String.valueOf(arrayChar[i] - 'a'))] = i;
}
}
for (int i = 0; i < 26; i++) {
System.out.print(arrayI[i] + " ");
}
}
}
'알고리즘' 카테고리의 다른 글
[PROGRAMMERS/Level2] (C++) 기능개발 (0) | 2020.07.06 |
---|---|
[BAEKJOON 1193번] (Java) 분수찾기 (0) | 2020.06.18 |
[BAEKJOON 2292번] (Java) 벌집 (0) | 2020.06.18 |
[BAEKJOON 1065번] (Java) 한수 (0) | 2020.06.18 |
[BAEKJOON 2941번] (Java) 크로아티아 알파벳 (0) | 2020.06.15 |