Deep_Lee
article thumbnail


์ž…์ถœ๋ ฅ ์˜ˆ์‹œ๋ฅผ ๋ณด๊ณ  ๊ทธ๋Œ€๋กœ ๊ณ„์‚ฐํ•˜์—ฌ ๊ตฌํ˜„ํ•ด๋ณด์•˜๋‹ค.

 

1. ์ค‘๊ฐ„ ๊ฐ’ ์ฐพ๊ธฐ 

2. ์‹œ์ž‘์  ์ฐพ๊ธฐ = ์ค‘๊ฐ„ ๊ฐ’์—์„œ ํŠน์ • ์ˆ˜๋ฅผ ๋บ€ ์ง€์ 

3. ํŠน์ • ์ˆ˜ = ์ค‘๊ฐ„ ๊ฐ’ - ( total%num ์ด 0์ด๋ƒ ์•„๋‹ˆ๋ƒ์— ๋”ฐ๋ผ ) 

 

 

class Solution {
    public int[] solution(int num, int total) {
       int[] answer = new int[num];

        int middle = total / num; // ์ค‘๊ฐ„ ๊ฐ’
        int sub = total % num == 0 ? num / 2 : num / 2 - 1; // ์ค‘๊ฐ„ ๊ฐ’์œผ๋กœ๋ถ€ํ„ฐ -๋ช‡๋ถ€ํ„ฐ ์‹œ์ž‘ํ• ์ง€

        int start = middle - sub; // ์‹œ์ž‘ number
        for (int i = 0; i < num; i++) {
            answer[i] = start + i;
        }
        return answer;
    }
}