minimum moves to equal array elements II

Author: fishercoder1534

MEDIUM/src/medium/MinimumMovestoEqualArrayElementsII.java

@@ -0,0 +1,38 @@
+package medium;
+
+import java.util.Arrays;
+
+public class MinimumMovestoEqualArrayElementsII {
+
+    public static int minMoves2(int[] nums) {
+        /**sort this array, find the median of this array as the pivot*/
+        Arrays.sort(nums);
+        int result = 0, result1 = 0;
+        if (nums.length%2 != 0) {
+            int median = nums[nums.length/2];
+            for ( int n : nums) {
+                result += Math.abs(n - median);
+            }
+            return result;
+        } else {
+            int median1 = nums[nums.length/2];
+            for ( int n : nums) {
+                result1 += Math.abs(n - median1);
+            }
+            int result2 = 0;
+            int median2 = nums[nums.length/2-1];
+            for ( int n : nums) {
+                result2 += Math.abs(n - median2);
+            }
+            result1 = Math.min(result1, result2);
+            return result1;
+        }
+        
+    }
+    
+    public static void main(String...args){
+        int[] nums = new int[]{1,2,3};
+        System.out.println(minMoves2(nums));
+    }
+
+}

README.md

@@ -2,6 +2,7 @@
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
 |463|[Island Perimeter](https://leetcode.com/problems/island-perimeter/)|[Solution](../../blob/master/EASY/src/easy/IslandPerimeter.java)| O(m*n)|O(1) | Easy| 
+|462|[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)|[Solution](../../blob/master/MEDIUM/src/medium/MinimumMovestoEqualArrayElementsII.java) | O(nlogn) |O(1) | Medium|
 |459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)|[Solution](../../blob/master/EASY/src/easy/RepeatedSubstringPattern.java)| O(n)|O(n) | Easy| KMP
 |456|[132 Pattern](https://leetcode.com/problems/132-pattern/)|[Solution](../../blob/master/MEDIUM/src/medium/_132Pattern.java) | O(n) |O(n) | Medium| Stack
 |455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/)|[Solution](../../blob/master/EASY/src/easy/AssignCookies.java)| O(n)|O(1) | Easy|