leetcode 453. Minimum Moves to Equal Array Elements
2016-11-23 19:48
417 查看
class Solution {
public:
int minMoves(vector<int>& nums) {
int x = nums[0];
for(int i = 0;i < nums.size() ;i++)
x = min(x,nums[i]);
int sum = 0;
for(int i = 0;i < nums.size(); i++)
sum = sum + nums[i] - x;
return sum;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 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
- Leetcode453. Minimum Moves to Equal Array Elements
- leetcode 453. Minimum Moves to Equal Array Elements（C语言，又是一招出奇制胜）46
- 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