LeetCode_453. Minimum Moves to Equal Array Elements
2024-09-01 02:20:30
453. Minimum Moves to Equal Array Elements
Easy
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]
package leetcode.easy; public class MinimumMovesToEqualArrayElements {
public int minMoves(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int min = nums[0];
for (int i = 0; i < nums.length; i++) {
min = Math.min(min, nums[i]);
}
int moves = 0;
for (int i = 0; i < nums.length; i++) {
moves += nums[i] - min;
}
return moves;
} @org.junit.Test
public void test() {
int[] nums = { 1, 2, 3 };
System.out.println(minMoves(nums));
}
}
最新文章
- 假如现在有一堆长度大于3小于9的电话号码,用座机呼叫,如果出现这样的号码【123和12345】那么12345将永远不会被拨出,因为拨到123的时候电话已经呼出了,试写一个函数输出所有不能被呼出的电话号码(java实现)
- OpenJudge计算概论-Tomorrow never knows【输入日期计算下一天的日期】
- multimap和multiset 认知和使用
- 团体程序设计天梯赛-练习集L1-003. 个位数统计
- ContextSwitchDeadlock was detected Message(读取注册表时出现).
- SQL SERVER 2012疑难问题解决方法
- java大数取余
- 曲线点抽稀算法-Python实现
- JavaWeb(八)JQuery
- H5动画
- C#中ASCII码学习心得
- C语言博客作业--数组
- java IO流全面总结
- [20190419]shared latch spin count.txt
- Django--ORM相关操作
- mysql 安装部署
- impala daemon启动失败
- hadoop的hdfs中的javaAPI操作
- 【leetcode 简单】 第六十七题 回文链表
- R语言编程艺术(1)快速入门