ARR PS - moving bricks

풀어보기

function answer(nums) {
    let move = 0;
    let height = nums.reduce((cur, acc) => cur + acc) / nums.length;
    while (true) {
        for (let i = 0; i < nums.length; i++) {
            if (height < nums[i]) {
                move++;
                nums[i]--;
            } else if (height === nums[i]) continue;
            else nums[i]++;
        }
        let set = new Set(nums);
        if (set.size === 1) break;
    }
    return move;
}