package com.fishercoder.solutions;

import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;

/**
 * 950. Reveal Cards In Increasing Order
 *
 * In a deck of cards, every card has a unique integer.  You can order the deck in any order you want.
 * Initially, all the cards start face down (unrevealed) in one deck.
 * Now, you do the following steps repeatedly, until all cards are revealed:
 * Take the top card of the deck, reveal it, and take it out of the deck.
 * If there are still cards in the deck, put the next top card of the deck at the bottom of the deck.
 * If there are still unrevealed cards, go back to step 1.  Otherwise, stop.
 * Return an ordering of the deck that would reveal the cards in increasing order.
 *
 * The first entry in the answer is considered to be the top of the deck.
 *
 * Example 1:
 * Input: [17,13,11,2,3,5,7]
 * Output: [2,13,3,11,5,17,7]
 *
 * Explanation:
 * We get the deck in the order [17,13,11,2,3,5,7] (this order doesn't matter), and reorder it.
 * After reordering, the deck starts as [2,13,3,11,5,17,7], where 2 is the top of the deck.
 * We reveal 2, and move 13 to the bottom.  The deck is now [3,11,5,17,7,13].
 * We reveal 3, and move 11 to the bottom.  The deck is now [5,17,7,13,11].
 * We reveal 5, and move 17 to the bottom.  The deck is now [7,13,11,17].
 * We reveal 7, and move 13 to the bottom.  The deck is now [11,17,13].
 * We reveal 11, and move 17 to the bottom.  The deck is now [13,17].
 * We reveal 13, and move 17 to the bottom.  The deck is now [17].
 * We reveal 17.
 * Since all the cards revealed are in increasing order, the answer is correct.
 *
 * Note:
 * 1 <= A.length <= 1000
 * 1 <= A[i] <= 10^6
 * A[i] != A[j] for all i != j
 */
public class _950 {
  public static class Solution1 {
    public int[] deckRevealedIncreasing(int[] deck) {
      Arrays.sort(deck);
      Deque<Integer> deque = new ArrayDeque<>();
      for (int i = deck.length - 1; i >= 0; i--) {
        if (i != deck.length - 1) {
          deque.addFirst(deque.pollLast());
        }
        deque.addFirst(deck[i]);
      }
      int[] result = new int[deck.length];
      int i = 0;
      while (!deque.isEmpty()) {
        result[i++] = deque.pollFirst();
      }
      return result;
    }
  }
}

@@ -112,1629 +112,8 @@
 e;%0A%0A
-/**%0A * 950. Reveal Cards In Increasing Order%0A *%0A * In a deck of cards, every card has a unique integer.  You can order the deck in any order you want.%0A * Initially, all the cards start face down (unrevealed) in one deck.%0A * Now, you do the following steps repeatedly, until all cards are revealed:%0A * Take the top card of the deck, reveal it, and take it out of the deck.%0A * If there are still cards in the deck, put the next top card of the deck at the bottom of the deck.%0A * If there are still unrevealed cards, go back to step 1.  Otherwise, stop.%0A * Return an ordering of the deck that would reveal the cards in increasing order.%0A *%0A * The first entry in the answer is considered to be the top of the deck.%0A *%0A * Example 1:%0A * Input: %5B17,13,11,2,3,5,7%5D%0A * Output: %5B2,13,3,11,5,17,7%5D%0A *%0A * Explanation:%0A * We get the deck in the order %5B17,13,11,2,3,5,7%5D (this order doesn't matter), and reorder it.%0A * After reordering, the deck starts as %5B2,13,3,11,5,17,7%5D, where 2 is the top of the deck.%0A * We reveal 2, and move 13 to the bottom.  The deck is now %5B3,11,5,17,7,13%5D.%0A * We reveal 3, and move 11 to the bottom.  The deck is now %5B5,17,7,13,11%5D.%0A * We reveal 5, and move 17 to the bottom.  The deck is now %5B7,13,11,17%5D.%0A * We reveal 7, and move 13 to the bottom.  The deck is now %5B11,17,13%5D.%0A * We reveal 11, and move 17 to the bottom.  The deck is now %5B13,17%5D.%0A * We reveal 13, and move 17 to the bottom.  The deck is now %5B17%5D.%0A * We reveal 17.%0A * Since all the cards revealed are in increasing order, the answer is correct.%0A *%0A * Note:%0A * 1 %3C= A.length %3C= 1000%0A * 1 %3C= A%5Bi%5D %3C= 10%5E6%0A * A%5Bi%5D != A%5Bj%5D for all i != j%0A */%0A
 publ
@@ -128,16 +128,18 @@
  _950 %7B%0A
+  
   public
@@ -164,16 +164,20 @@
 tion1 %7B%0A
+    
     publ
@@ -228,16 +228,22 @@
 %7B%0A      
+ 
+     
 Arrays.s
@@ -259,16 +259,22 @@
 ;%0A      
+  
+    
 Deque%3CIn
@@ -314,16 +314,22 @@
 ;%0A      
+   
+   
 for (int
@@ -373,16 +373,24 @@
         
+   
+     
 if (i !=
@@ -411,32 +411,42 @@
  1) %7B%0A          
+         
+ 
 deque.addFirst(d
@@ -475,18 +475,30 @@
     
-%7D%0A
+        %7D%0A    
         
 dequ
@@ -485,32 +485,36 @@
   %7D%0A            
+    
 deque.addFirst(d
@@ -528,24 +528,36 @@
 ;%0A      
-%7D%0A
+      %7D%0A    
       
+  
 int%5B%5D re
@@ -585,16 +585,22 @@
 ength%5D;%0A
+      
       in
@@ -614,16 +614,22 @@
 ;%0A      
+     
+ 
 while (!
@@ -643,24 +643,32 @@
 sEmpty()) %7B%0A
+        
         resu
@@ -698,26 +698,38 @@
 st();%0A      
+     
+ 
 %7D%0A
+      
       return
@@ -741,16 +741,22 @@
 lt;%0A    
-%7D%0A
+    %7D%0A  
   %7D%0A%7D%0A

refactor 950