LeetCode: Minimum Moves to Equal Array Elements
2016-11-25 10:28
387 查看
n-1个element加1相当于一个元素减1，那最少的move就是所有元素减去最小值之和
1 public class Solution {
2 public int minMoves(int[] nums) {
3 int min = nums[0];
4 for (int i = 0; i < nums.length; i++) {
5 min = Math.min(min, nums[i]);
6 }
7 int ans = 0;
8 for (int i = 0; i < nums.length; i++) {
9 ans += nums[i] - min;
10 }
11 return ans;
12 }
13 }
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode] Minimum Moves to Equal Array Elements II 最少移动次数使数组元素相等之二
- 【LeetCode-462】Minimum Moves to Equal Array Elements II
- [leetcode][462] Minimum Moves to Equal Array Elements II
- leetcode 453 Minimum Moves to Equal Array Elements C++
- Leetcode 之 Minimum Moves to Equal Array Elements II
- 【LeetCode】Minimum Moves to Equal Array Elements 解题报告
- Leetcode 453 Minimum Moves to Equal Array Elements
- LeetCode "Minimum Moves to Equal Array Elements"
- LeetCode Minimum Moves to Equal Array Elements
- leetcode oj java Minimum Moves to Equal Array Elements
- Leetcode-453 Minimum Moves to Equal Array Elements
- LeetCode: Minimum Moves to Equal Array Elements II
- leetcode Minimum Moves to Equal Array Elements
- Leetcode: Minimum Moves to Equal Array Elements
- [LeetCode]Minimum Moves to Equal Array Elements II(Java)
- Leetcode 462 Minimum Moves to Equal Array Elements II
- [leetcode 453]Minimum Moves to Equal Array Elements
- [LeetCode]Minimum Moves to Equal Array Elements(Java)
- LeetCode Minimum Moves to Equal Array Elements II
- LeetCode No.453 Minimum Moves to Equal Array Elements