[pull] master from wisdompeak:master

Math/462.Minimum-Moves-to-Equal-Array-Elements-II/462.Minimum-Moves-to-Equal-Array-Elements-II.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int minMoves2(vector<int>& nums) 
+    {
+        sort(nums.begin(),nums.end());
+        int median=nums[nums.size()/2];
+        int result=0;
+        for (int i=0; i<nums.size(); i++)
+            result+=abs(nums[i]-median);
+        return result;
+    }
+};

Math/462.Minimum-Moves-to-Equal-Array-Elements-II/Readme.md

@@ -0,0 +1,3 @@
+### 462.Minimum-Moves-to-Equal-Array-Elements-II
+
+本题的本质就是`296.Best-Meeting-Point`。满足`minimize Sum{|xi-p|}`的最优点p就是{xi}的中位数。

Readme.md

@@ -1030,7 +1030,7 @@
 [2217.Find-Palindrome-With-Fixed-Length](https://github.com/wisdompeak/LeetCode/tree/master/Math/2217.Find-Palindrome-With-Fixed-Length) (M+)      
 * ``Distances``   
 [296.Best-Meeting-Point](https://github.com/wisdompeak/LeetCode/tree/master/Math/296.Best-Meeting-Point) (M+)  
-462.Minimum-Moves-to-Equal-Array-Elements-II    
+[462.Minimum-Moves-to-Equal-Array-Elements-II](https://github.com/wisdompeak/LeetCode/tree/master/Math/462.Minimum-Moves-to-Equal-Array-Elements-II) (M-)    
 [2033.Minimum-Operations-to-Make-a-Uni-Value-Grid](https://github.com/wisdompeak/LeetCode/tree/master/Math/2033.Minimum-Operations-to-Make-a-Uni-Value-Grid) (M+)      
 [1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones](https://github.com/wisdompeak/LeetCode/tree/master/Math/1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones) (H)  
 [1478.Allocate-Mailboxes](https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1478.Allocate-Mailboxes) (H)