LeetCode 453. Minimum Moves to Equal Array Elements
2016-12-24 13:21
507 查看
描述
给出一个数组，每次对n - 1个数加1，问经过多少次所有的数相等解决
对n - 1个数加1等价于对1个数减1，答案就是所有数的和减去数组长度乘以最小数的积class Solution {
public:
int minMoves(vector<int>& nums) {
int sum = 0, min_val = INT_MAX;
for (auto val : nums)
{
sum += val;
if (val < min_val)
{
min_val = val;
}
}
return sum - nums.size() * min_val;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【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
- 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】【Easy】【453. Minimum Moves to Equal Array Elements】【math】
- 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