【C语言】 leetcode 453. Minimum Moves to Equal Array Elements
2017-01-05 18:52
429 查看
题目
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:
Input: [1,2,3] Output: 3 Explanation: Only three moves are needed (remember each move increments two elements): [1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]
思路
题目希望用最少的步骤是的所有的数字相同,每次n-1个元素加1,观察例子可以看出每次是的不是最大的n-1个数字加1,那么转换过来就是每次使最大的那个数字减1,所以为了是的数组一致,所有的数字都必然会减到最小的那个数字。解答
int minMoves(int* nums, int numsSize) { int min=nums[0]; int sum=0; for(int i=0;i<numsSize;i++) { sum+=nums[i]; if(min>nums[i]) min=nums[i]; } return sum-numsSize*min; }
相关文章推荐
- 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
- 453. Minimum Moves to Equal Array Elements [LeetCode]
- leetcode 453. Minimum Moves to Equal Array Elements
- 【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】【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