[Programmers] Lv1: 수박수박수박수박수박수?(12922)

문제

- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12922

 

풀이

class Solution {
    public String solution(int n) {
        String answer = "";
        
        for (int i = 0; i < n/2; ++i) {
            answer += "수박";    
        }
        
        if (n % 2 == 1) {
            answer += "수";
        }
        
        return answer;
    }
}