@@ -0,0 +1,2065 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 723. Candy Crush%0A *%0A * This question is about implementing a basic elimination algorithm for Candy Crush.%0A * Given a 2D integer array board representing the grid of candy, different positive integers board%5Bi%5D%5Bj%5D%0A * represent different types of candies.%0A * A value of board%5Bi%5D%5Bj%5D = 0 represents that the cell at position (i, j) is empty.%0A * The given board represents the state of the game following the player's move.%0A * Now, you need to restore the board to a stable state by crushing candies according to the following rules:%0A *%0A * If three or more candies of the same type are adjacent vertically or horizontally,%0A * %22crush%22 them all at the same time - these positions become empty.%0A * After crushing all candies simultaneously, if an empty space on the board has candies on top of itself,%0A * then these candies will drop until they hit a candy or bottom at the same time.%0A * (No new candies will drop outside the top boundary.)%0A * After the above steps, there may exist more candies that can be crushed.%0A * If so, you need to repeat the above steps.%0A * If there does not exist more candies that can be crushed (ie. the board is stable), then return the current board.%0A * You need to perform the above rules until the board becomes stable, then return the current board.%0A%0A Example 1:%0A%0A Input:%0A board =%0A %5B%5B110,5,112,113,114%5D,%5B210,211,5,213,214%5D,%5B310,311,3,313,314%5D,%5B410,411,412,5,414%5D,%5B5,1,512,3,3%5D,%5B610,4,1,613,614%5D,%5B710,1,2,713,714%5D,%5B810,1,2,1,1%5D,%5B1,1,2,2,2%5D,%5B4,1,4,4,1014%5D%5D%0A%0A Output:%0A %5B%5B0,0,0,0,0%5D,%5B0,0,0,0,0%5D,%5B0,0,0,0,0%5D,%5B110,0,0,0,114%5D,%5B210,0,0,0,214%5D,%5B310,0,0,113,314%5D,%5B410,0,0,213,414%5D,%5B610,211,112,313,614%5D,%5B710,311,412,613,714%5D,%5B810,411,512,713,1014%5D%5D%0A Explanation:%0A%0A Note:%0A The length of board will be in the range %5B3, 50%5D.%0A The length of board%5Bi%5D will be in the range %5B3, 50%5D.%0A Each board%5Bi%5D%5Bj%5D will initially start as an integer in the range %5B1, 2000%5D.%0A%0A */%0Apublic class _723 %7B%0A    public static class Solution1 %7B%0A        public int%5B%5D%5B%5D candyCrush(int%5B%5D%5B%5D board) %7B%0A            return null;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton of 723