453. Minimum Moves to Equal Array Elements
来源:互联网 发布:linux怎么读音是什么 编辑:程序博客网 时间:2024/05/17 22:46
n-1个数加1——–剩下一个数减1
class Solution {public: int minMoves(vector<int>& nums) { if(nums.size()<=1) return 0; else { int sum=0; int min=nums[0]; for(int i=0;i<nums.size();i++) { sum+=nums[i]; if(nums[i]<min) min=nums[i]; } return sum-min*nums.size(); } }};
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
- int * const *, const int * const *, const int **
- 【bzoj3238】差异 后缀自动机
- Python基础教程(2)
- 为什要使用BindService?为了调用服务中的方法
- codeforces 528D. Fuzzy Search (FFT优化DP)
- 453. Minimum Moves to Equal Array Elements
- leetcode总结帖
- c++ 调试问题 集合
- 55. Jump Game
- 【BZOJ 2618】[Cqoi2006]凸多边形 半平面交
- 来电去电自动录音
- 上下移动页面元素的代码
- BZOJ 1087 [SCOI2005] 互不侵犯King
- 多线程下变量-gcc原子操作 __sync_fetch_and_add等