packageeasy;

importjava.util.Comparator;

importjava.util.PriorityQueue;

importjava.util.Queue;

publicclassMinimumMovestoEqualArrayElements {

publicstaticintminMoves(int[]nums) {

Queue<Integer>heap =newPriorityQueue<Integer>(newComparator<Integer>(){

publicintcompare(Integero1,Integero2) {

if(o1 >o2)return1;

elseif(o1 <o2)return -1;

elsereturn0;

}

});//in ascending order

intmax =Integer.MIN_VALUE;

for(inti =0;i <nums.length;i++){

max =Math.max(max,nums[i]);

heap.offer(nums[i]);

}

intmoves =0;

while(!heap.isEmpty()){

intone =heap.poll();

inttwo =heap.poll();

one++;

two++;

moves++;

max =Math.max(max,Math.max(one,two));

heap.offer(one);

heap.offer(two);

if(heap.peek() ==max)break;

}

returnmoves;

}

publicstaticvoidmain(String...args){

int[]nums =newint[]{1,2,3};

System.out.println(minMoves(nums));

}

}

| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes

|-----|----------------|---------------|---------------|---------------|-------------|--------------|-----

|453|[Minimum Moves to Equal Array Elementss](https://leetcode.com/contest/12/problems/minimum-moves-to-equal-array-elements/)|[Solution](../../blob/master/EASY/src/easy/MinimumMovestoEqualArrayElements.java)| O(n)|O(n) | Easy| BFS

|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