首页 > 其他 > 详细

LeetCode "Minimum Moves to Equal Array Elements"

时间:2016-11-12 13:50:38      阅读:166      评论:0      收藏:0      [点我收藏+]

Increasing all elements by 1 except one element, equals to decreasing that one element.

class Solution {
public:
    int minMoves(vector<int>& nums) 
    {
        int minv = *min_element(nums.begin(), nums.end());
        
        int ret = 0;
        for(auto v : nums) ret += v - minv;
        
        return ret;
    }
};

LeetCode "Minimum Moves to Equal Array Elements"

原文:http://www.cnblogs.com/tonix/p/6056447.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!