GravityPuzzleEasy | Topcoder Archive

Problem Statement

We have a rectangular board divided into unit square cells. The board is mounted on a wall, with rows going horizontally and columns vertically. Each cell contains at most one box. You are given the current state of the board in the String[] board. The elements of board describe the rows of the board from top to bottom. (I.e., board[0] describes the topmost row of the board, and so on.) The characters of board[r] describe the cells in row r from left to right, with '.' being an empty cell and '#' a cell with a box.

Due to gravity, each box will fall down: whenever a cell below a box is empty, the box can fall into that cell. Thus, if you have a column with k boxes, those will eventually occupy the bottommost k cells in that column.

Please return a String[] describing the state of the board after all boxes finish falling down.

Definition

Class:: GravityPuzzleEasy
Method:: solve
Parameters:: String[]
Returns:: String[]
Method signature:: String[] solve(String[] board)
(be sure your method is public)

Constraints

board will contain between 1 and 50 elements, inclusive.
Each element in board will contain between 1 and 50 characters, inclusive.
Each element in board will contain the same number of characters.
Each character in board will be '.' or '#'.

Examples

```
{"#",
 ".",
 "."}
```
```
Returns: {".", ".", "#" }
```
This box will fall to the bottom, so we get: . . #

{"##",
 ".#",
 "#."}

Returns: {"..", "##", "##" }

This time we have 2 boxes in each column.

{"..#.#",
 "#.#..",
 "...##"}

Returns: {".....", "..#.#", "#.###" }

{"#####",
 "#####",
 "#####",
 "#####"}

Returns: {"#####", "#####", "#####", "#####" }

```
{"."}
```
```
Returns: {"." }
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.