Leetcode 462 Minimum Moves to Equal Array Elements II
来源：互联网 发布：合肥数码美工招聘信息 编辑：程序博客网 时间：2024/06/05 03:12
Leetcode 462 Minimum Moves to Equal Array Elements II
class Solution {public: int minMoves2(vector<int>& nums) { sort(nums.begin(),nums.end()); int count = 0; for(int i : nums) { count += abs(i - nums[nums.size() / 2]; } return count; } int minMoves22(vector<int>& nums) { int len = nums.size(); int count = 0; nth_element(nums.begin(),nums.begin() + len / 2, nums.end());//nums不是is_sorted，只是切分出来前一半比中位数小，后一半比中位数大 for(int i : nums) count += abs(i - nums[len / 2]); return count; }};阅读全文
0 0
- leetcode 462 Minimum Moves to Equal Array Elements II C++
- 【LeetCode-462】Minimum Moves to Equal Array Elements II
- Leetcode 462 Minimum Moves to Equal Array Elements II
- [leetcode][462] Minimum Moves to Equal Array Elements II
- LeetCode 462 Minimum Moves to Equal Array Elements II (中位数)
- Leetcode 462 Minimum Moves to Equal Array Elements II
- 【leetcode】462. Minimum Moves to Equal Array Elements II【M】
- Leetcode 之 Minimum Moves to Equal Array Elements II
- [LeetCode]Minimum Moves to Equal Array Elements II(Java)
- LeetCode 462. Minimum Moves to Equal Array Elements II
- LeetCode笔记：462. Minimum Moves to Equal Array Elements II
- LeetCode 462. Minimum Moves to Equal Array Elements II
- Leetcode-462. Minimum Moves to Equal Array Elements II
- 【LeetCode】 462. Minimum Moves to Equal Array Elements II
- LeetCode 462. Minimum Moves to Equal Array Elements II
- LeetCode 462. Minimum Moves to Equal Array Elements II
- [LeetCode]462. Minimum Moves to Equal Array Elements II
- 【LeetCode】462. Minimum Moves to Equal Array Elements II
- Leetcode 415 Add Strings
- Leetcode 453 Minimum Moves to Equal Array Elements
- 如何定义java中的方法
- SQL Server远程定时备份数据库脚本
- LNMP 性能优化之 PHP 性能优化
- Leetcode 462 Minimum Moves to Equal Array Elements II
- Leetcode 599 Minimum Index Sum of Two Lists
- idea 2017打包jar包
- Jdk中的Timer
- hdu 6036 NTT取模（板子）+组合数学
- Leetcode 643 Maximum Average Subarray I
- 【Java虚拟机】之五 语法糖的味道
- Java中无参带返回值方法的使用
- 如何才能变得富有？秘密就在这三点里
