correct minimum moves to equal array elements

Author: fishercoder1534

EASY/src/easy/MinimumMovestoEqualArrayElements.java

@@ -1,41 +1,16 @@
 package easy;
 
-import java.util.Comparator;
-import java.util.PriorityQueue;
-import java.util.Queue;
-
 public class MinimumMovestoEqualArrayElements {
-
+    /**Looked at this solution: https://discuss.leetcode.com/topic/66557/java-o-n-solution-short
+     * i.e. Add 1 to n-1 elements basically equals to subtracting 1 from one element. So the easiest way
+     * to make all elements in this array equal is to make all of them equal to the minimum element.*/
     public static int minMoves(int[] nums) {
-        Queue<Integer> heap = new PriorityQueue<Integer>(new Comparator<Integer>(){
-            @Override
-            public int compare(Integer o1, Integer o2) {
-                if(o1 > o2) return 1;
-                else if(o1 < o2) return -1;
-                else return 0;
-            }
-        });//in ascending order
-        
-        int max = Integer.MIN_VALUE;
-        for(int i = 0; i < nums.length; i++){
-            max = Math.max(max, nums[i]);
-            heap.offer(nums[i]);
-        }
-        
-        int moves = 0;
-        while(!heap.isEmpty()){
-            //always increments two elements
-            int one = heap.poll();
-            int two = heap.poll();
-            one++;
-            two++;
-            moves++;
-            max = Math.max(max, Math.max(one, two)); 
-            heap.offer(one);
-            heap.offer(two);
-            if(heap.peek() == max) break;
-        }
-        return moves;
+        if(nums.length == 0) return 0;
+        int min = nums[0];
+        for(int n : nums) min = Math.min(min, n);
+        int res = 0;
+        for(int n : nums) res += n - min;
+        return res;
     }
 
     public static void main(String...args){

README.md

@@ -1,8 +1,8 @@
 # fishercoderLeetcode
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
-|453|[Minimum Moves to Equal Array Elementss](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)|[Solution](../../blob/master/EASY/src/easy/MinimumMovestoEqualArrayElements.java)| O(n)|O(n) | Easy| BFS
-|447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)|[Solution](../../blob/master/EASY/src/easy/NumberofBoomerangs.java)| O(n^2)|O(n) | Easy|
+|453|[Minimum Moves to Equal Array Elementss](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)|[Solution](../../blob/master/EASY/src/easy/MinimumMovestoEqualArrayElements.java)| O(n)|O(1) | Easy|
+|447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)|[Solution](../../blob/master/EASY/src/easy/NumberofBoomerangs.java)| O(n^2)|O(n) | Easy| HashMap
 |441|[Arranging Coins](https://leetcode.com/problems/arrange-coins/)|[Solution](../../blob/master/EASY/src/easy/ArrangingCoins.java)| O(n)|O(1) | Easy|
 |419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)|[Solution](../../blob/master/MEDIUM/src/medium/BattleshipsinaBoard.java) | O(n^2) |O(1) | Medium| DFS
 |417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)|[Solution](../../blob/master/MEDIUM/src/medium/PacificAtlanticWaterFlow.java) | O(m*n*Max(m,n)) |O(m*n) | Medium| DFS