[알고리즘문제풀기] 연속된 수의 합

문제

내가 작성한 정답

class Solution {
    public int[] solution(int num, int total) {
        int[] answer = new int[num];
        for(int i=0; i<num; i++){
            answer[i] = (int)(total/num)+i-(int)(num/2)+(num%2==0?1:0);
        }
        return answer;
    }
}

다른 사람들의 정답

class Solution {
        public int[] solution(int num, int total) {
                int[] answer = new int[num];
                int check = num*(num+1) / 2;
                int start = (total - check) / num + 1;
                for (int i = 0; i < answer.length; i++) {
                        answer[i] = start + i ;
                }
                return answer;
        }
}

class Solution {
    public int[] solution(int num, int total) {
        int[] answer=new int[num];
        int point1= total/num + (1-num)/2;
        for(int i=0; i<num; i++) {
            answer[i] = point1++;
        }
        return answer;
    }
}


class Solution {
    public int[] solution(int num, int total) {
        int[] answer = new int[num];
        int temp = 0;
        for(int i=0;i<num;i++){
            temp+=i;
        }
        int value = (total-temp)/num;

        for(int i=0;i<num;i++){
            answer[i]=i+value;
        }

        return answer;
    }
}