- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- 453. Minimum Moves to Equal Arra
- Leetcode PHP题解--D107 453. Minimu
- quickselect方法找Medium
- 462. Minimum Moves to Equal Arra
- 462. Minimum Moves to Equal Arra
这道题还是思维的转变问题，n-1个数+1不就相当于剩下那个数-1么。。。。统一到一起就行了，还是思维问题啊T T人家写法也挺漂亮的。
我的解法
class Solution {
public:
int minMoves(vector<int>& nums) {
sort(nums.begin(), nums.end());
int temp = nums[0], output = 0;
for (int i = 1; i < nums.size(); i ++)
output += nums[i] - temp;
return output;
}
};
人家的解法
int minMoves(vector<int>& nums) {
return accumulate(begin(nums), end(nums), 0L) - nums.size() * *min_element(begin(nums), end(nums));
}
网友评论