453. Minimum Moves to Equal Array Elements
来源:互联网 发布:儿童网络学英语 编辑:程序博客网 时间:2024/05/11 12:10
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:3Explanation:Only three moves are needed (remember each move increments two elements):[1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]
最优解,摘自
https://discuss.leetcode.com/topic/66557/java-o-n-solution-short
Add 1
to n - 1
elements is the same as subtracting 1
from one element, w.r.t goal of making the elements in the array equal.
So, best way to do this is make all the elements in the array equal to the min
element.
public class Solution { public int minMoves(int[] nums) { if (nums.length == 0) return 0; int min = nums[0]; for (int n : nums) min = Math.min(min, n); int res = 0; for (int n : nums) res += n - min; return res; }}
0 0
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements*
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 453. Minimum Moves to Equal Array Elements
- 第十周项目一 二叉树算法库
- BAT、360、网易等大公司开源项目
- query
- JQ:.val(), .text(), .html()
- ubuntu系统开root以及(su:认证失败)解决
- 453. Minimum Moves to Equal Array Elements
- poj2046 Power Strings(KMP)
- 第一次机房收费系统--详细设计说明书
- 用栈的思想来判断一个字符串是否是回文数
- [Python]网络爬虫(五):urllib2的使用细节与抓站技巧
- Opencv实现图像无缝拼接,Sift查找特征点,Flann进行匹配
- oracle中数据导入导出问题
- [深度学习论文笔记][Instance Segmentation] Simultaneous Detection and Segmentation
- JavaScript强化教程 - 六步实现贪食蛇