[백준] 10809. 알파벳 찾기(브론즈2)

백준(브론즈2) - 10809. 알파벳 찾기(브론즈2)

풀이

indexOf라는 함수를 이용해서 문제를 풀어줬다.

package com.study.algo;

import java.util.Scanner;

public class BOJ10809 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		char[] alphabet = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r',
				's','t','u','v','w','x','y','z'};
		
		for(int i=0; i<alphabet.length; i++) {
			System.out.print(s.indexOf(alphabet[i]) + " ");
		}
		sc.close();
	}
}