LeetCode 453. Minimum Moves to Equal Array Elements

题目：
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]

思路：
因为sum+m*(len-1)=x*len，min+m=x，sum-num*len=m，所以就是需要求出最小值，结果就是结果返回sum-num*len

代码：

class Solution {
public:int minMoves(vector<int>& nums) {int sum=0;int min=nums[0];//min的初始值为数组第一个元素int len=nums.size();for(int i=0;i<len;++i){min=nums[i]<min?nums[i]:min;//求数组中最小的元素sum+=nums[i];//求和}return sum-min*len;//根据思路说明返回结果}
};

**输出结果：**53ms

LeetCode 453. Minimum Moves to Equal Array Elements相关推荐

leetcode 462. Minimum Moves to Equal Array Elements II
这道题目和leetcode453是有联系的,虽然这道题难度为中等,但是我感觉初等难度的453绕的弯子更大一些. 题目:Given a non-empty integer array, find the ...
LeetCode 462 Minimum Moves to Equal Array Elements II
问题:给出一个数组,每次可以从中选择一个数+1或者-1,使得数组中的所有元素相等,要求操作次数最少. 思路:假设元素分别为x1,x2,...,xn,元素最终等于x,则要求|x1-x|+|x2-x|+. ...
453. Minimum Moves to Equal Array Elements (python)
leetcode 453,462. Minimum Moves to Equal Array Elements I, II | 453, 462. 最少移动次数使数组元素相等（图解）
453. Minimum Moves to Equal Array Elements https://leetcode.com/problems/minimum-moves-to-equal-arra ...
LeetCode Minimum Moves to Equal Array Elements II
原题链接在这里:https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/ 题目: Given a non-empt ...
C#LeetCode刷题之#453-最小移动次数使数组元素相等（Minimum Moves to Equal Array Elements）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3877 访问. 给定一个长度为 n 的非空整数数组,找到让数组所有 ...
java求最小步数,使数组值相等的最小步数 Minimum Moves to Equal Array Elements
问题: Given a non-empty integer array of size n, find the minimum number of moves required to make all ...
leetcode-453-Minimum Moves to Equal Array Elements
题目描述: Given a non-empty integer array of size n, find the minimum number of moves required to make a ...
LeetCode Find Minimum in Rotated Sorted Array II
Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are allowed? Woul ...

LeetCode 453. Minimum Moves to Equal Array Elements

LeetCode 453. Minimum Moves to Equal Array Elements相关推荐

最新文章

热门文章