leetcode 453. Minimum Moves to Equal Array Elements
2017-03-08 16:47
681 查看
public class Solution {
// 将每次n-1个数加1直到数列全都相等，与每次将数列一个元素减一直到数列值都相等，需要的操作次数相等
public int minMoves(int[] nums) {
int sum = 0;
int min = Integer.MAX_VALUE;
for (int val : nums )
{
if (val<min)
min = val;
sum += val;
}
return sum - nums.length * min;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【leetcode】453. Minimum Moves to Equal Array Elements【E】
- 小白笔记---------------------leetcode( 453. Minimum Moves to Equal Array Elements )
- [LeetCode]453. Minimum Moves to Equal Array Elements
- LeetCode_453. Minimum Moves to Equal Array Elements
- 【Leetcode】453. Minimum Moves to Equal Array Elements
- LeetCode453. Minimum Moves to Equal Array Elements我是这么解答的
- 453. Minimum Moves to Equal Array Elements [LeetCode]
- Leetcode——453. Minimum Moves to Equal Array Elements
- LeetCode-453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- [leetcode] 453. Minimum Moves to Equal Array Elements 解题报告
- LeetCode 453. Minimum Moves to Equal Array Elements
- [leetcode]453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- Leetcode 453. Minimum Moves to Equal Array Elements 使数组相等 解题报告
- LeetCode 453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements
- Leetcode 453. Minimum Moves to Equal Array Elements
- LeetCode 453. Minimum Moves to Equal Array Elements