๐Ÿ’ก Algorithm

[Java] ํ‘ธ๋“œ ํŒŒ์ดํŠธ ๋Œ€ํšŒ (Lv. 1)

jcowwk 2025. 3. 12. 22:58

ํ‘ธ๋“œ ํŒŒ์ดํŠธ ๋Œ€ํšŒ (Lv. 1)


1. ๋ฌธ์ œ

2. ํ’€์ด


1. ๋ฌธ์ œ

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

SW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก, ์ฑ„์šฉ๊นŒ์ง€ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„

programmers.co.kr

 

2. ํ’€์ด

class Solution {
    public String solution(int[] food) {
        StringBuilder sb = new StringBuilder();
        
        for (int i = 1; i < food.length; i++) {
            int count = food[i] / 2;
            sb.append(String.valueOf(i).repeat(count));
        }
        
        String answer = sb + "0";
        answer += sb.reverse();
        
        return answer;
    }
}

 

food๋ฐฐ์—ด์— ์ฃผ์–ด์ง„ ์Œ์‹์„ ๊ณตํ‰ํ•˜๊ฒŒ ๋ฐฐ์น˜ํ•˜์—ฌ ๋ฌธ์ž์—ด๋กœ ์ถœ๋ ฅํ•˜๋Š” ๋ฌธ์ œ์ž…๋‹ˆ๋‹ค.

String.valueOf(i)๋ฅผ ํ†ตํ•ด i๋ฅผ ๋ฌธ์ž์—ด(i = 2 -> "2")๋กœ ๋ฐ”๊ฟ”์ค๋‹ˆ๋‹ค. 

.repeat(count)๋ฅผ ํ™œ์šฉํ•˜์—ฌ ๋ฌธ์ž์—ด count๋งŒํผ ๋ฐ˜๋ณตํ•ด์„œ sb.append()๋ฅผ ํ†ตํ•ด ๋ถ™์—ฌ์ค๋‹ˆ๋‹ค.


์ฐธ๊ณ  ์‚ฌ์ดํŠธ

๋ฌธ์ œ๊ฐ€ ์žˆ์œผ๋ฉด ๋Œ“๊ธ€ ๋‚จ๊ฒจ์ฃผ์„ธ์š” !

ํ”ผ๋“œ๋ฐฑ์€ ์–ธ์ œ๋‚˜ ํ™˜์˜์ž…๋‹ˆ๋‹ค <3