LeetCode 453. Minimum Moves to Equal Array Elements

David_DLUT

于 2016-12-30 13:25:33 发布

阅读量252

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/David_DLUT/article/details/53941736

LeetCode 专栏收录该内容

42 篇文章

订阅专栏

本文探讨了一种算法，该算法能够确定将非空整数数组的所有元素变为相等所需的最少移动次数。移动操作定义为将数组中除了一个元素外的所有其他元素递增1。通过示例展示了算法的应用过程，并提供了一个具体的实现方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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]

class Solution {
public:
    int minMoves(vector<int>& nums) {
        int result = 0;
        int min_val = INT_MAX;
        int n = nums.size();
        for (int i = 0; i < n; ++i) {
            min_val = min(min_val, nums[i]);
            result += nums[i];
        }
        result -= n * min_val;
        return result;
    }
};