leetcode 453,462. Minimum Moves to Equal Array Elements I, II | 453, 462. 最少移动次数使数组元素相等（图解）

╰+哭是因爲堅強的太久メ 2022-09-07 06:14 114阅读 0赞

## 453. Minimum Moves to Equal Array Elements ##

[https://leetcode.com/problems/minimum-moves-to-equal-array-elements/][https_leetcode.com_problems_minimum-moves-to-equal-array-elements]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70]

## 题解 ##

将 n-1 个数都 +1，相当于将自身 -1

class Solution { 
        public int minMoves(int[] nums) { 
            int min = nums[0];
            int sum = 0;
            for (int n : nums) { 
                sum += n;
                min = Math.min(min, n);
            }
            return sum - min * nums.length;
        }
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 1]

--------------------

## 462. Minimum Moves to Equal Array Elements II ##

[https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/][https_leetcode.com_problems_minimum-moves-to-equal-array-elements-ii]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 2]

## 题解 ##

看图~ 解释了为什么要选中位数。  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 3]

class Solution { 
        public int minMoves2(int[] nums) { 
            Arrays.sort(nums);
            int m = nums[nums.length / 2]; // 中位数
            int sum = 0;
            for (int n : nums) { 
                sum += Math.abs(n - m);
            }
            return sum;
        }
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 4]

[https_leetcode.com_problems_minimum-moves-to-equal-array-elements]: https://leetcode.com/problems/minimum-moves-to-equal-array-elements/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70]: /images/20220829/a16d79bf67884ab4ba203dfba411caf6.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 1]: /images/20220829/ff4a7036db8a449d9ce8bc9fda4ab5a4.png
[https_leetcode.com_problems_minimum-moves-to-equal-array-elements-ii]: https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 2]: /images/20220829/29acfd687f6c434399bf8f872e3d0ac9.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 3]: /images/20220829/a4d59032e9b94680840e6edea23ec8ca.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 4]: /images/20220829/c0f1043ca222485cae583e1193c179a9.png