kingsubin kingsubin

class Solution { public String solution(int n) { String su = "수"; String bak = "박"; StringBuffer answer = new StringBuffer(); if (n == 1) { return su; } if (n % 2 == 0) { for (int i = 0; i < n/2; i++) { answer.append(su); answer.append(bak); } } else { for (int i = 0; i < n/2; i++) { answer.append(su); answer.append(bak); } answer.append(su); } return answer.toString(); } } - 성공 - 쉬운문젠데 어렵게 푼거 같..