본문 바로가기
Algorithm/Programmers

[Programmers] Lv.0 | 모스부호 (1) | Java

by unknownomad 2025. 10. 21.

문제

https://school.programmers.co.kr/learn/courses/30/lessons/120838

 

풀이

import java.util.*;

class Solution {
    public String solution(String letter) {
         Map<String, String> morse = new HashMap<>();
        String[] morseCode = {
            ".-","-...","-.-.","-..",".","..-.","--.","....","..",".---",
            "-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-",
            "..-","...-",".--","-..-","-.--","--.."
        };

        for (int i = 0; i < morseCode.length; i++) {
            morse.put(morseCode[i], String.valueOf((char) ('a' + i)));
        }

        String[] words = letter.split(" ");
        StringBuilder answer = new StringBuilder();

        for (String word : words) {
            answer.append(morse.get(word));
        }

        return answer.toString();
    }
}

댓글