๐ŸŒท๐ŸŒผ๋ชจ์—ฌ๋ด์š” ๊ฐœ๋ฐœ์˜์ˆฒ๐ŸŒท๐ŸŒผ

[JAVA/ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์•ผ๊ทผ์ง€์ˆ˜ ๋ณธ๋ฌธ

๊ฐœ๋ฐœ/์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฌธ์ œํ’€์ด JAVA

[JAVA/ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ์•ผ๊ทผ์ง€์ˆ˜

์š”์ผ์ด 2023. 3. 15. 14:43
๋ฐ˜์‘ํ˜•

๋ฌธ์ œ

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

 

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

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

ํ’€์ด

import java.util.*;

class Solution {
     public long solution(int n, int[] works) {
        long answer = 0;
        long sum = 0;

        for(int i=0; i<works.length; i++){
            sum += works[i];
        }

        sum -= n;

        if(sum < 0){
            return 0;
        }

        if(sum % works.length == 0){
            long a = sum / works.length;
            for(int i=0; i< works.length; i++){
                answer += Math.pow(a, 2);
            }
        }else{
            long a = sum / works.length;
            long b = sum % works.length;

            for(int i=0; i< works.length; i++){
                if(b>0){
                    answer += Math.pow(a+1, 2);
                    b--;
                }else{
                    answer += Math.pow(a, 2);
                }
            }

        }

        return answer;
    }
}
Comments