Question

USE JAVA ONLY :

public int canEscapeMaze(char[][] maze)

Complete a method to determine if it is possible to escape a maze while collecting all of the coins scattered throughout the maze.

The maze is represented with a rectangular 2d array of chars. Each element of the 2d array is a cell and the maze has 6 types of cells:

• Starting cell: The Starting cell is marked with an S. There is only one Starting cell in the maze. The starting cell becomes a green cell after we leave it.
• Impassable cells. Impassable cells are marked with an asterisk, *. We may not enter impassable cells.
• Green cells. Green cells are marked initially with a G. When we leave a green cell it becomes a yellow cells as described below.
• Yellow cells. Yellow cells are marked initially with a Y. When we leave a yellow cell it becomes an impassable cell as described above.
• Money cells. Gold cells are marked with a $. Each money cell contains a single gold coin we will pick up as we travel through the maze. There is no limit to the number of coins we can pick up. When we leave a money cell it becomes a yellow cell as described above.
• Exit cells. Exit cells are marked with an E. If we can reach an Exit cell we can escape the maze. Exit cells may appear any where in the maze, not just on the edges. There may me multiple exit cells in the maze. We we step into an Exit cell, we exit the maze due to being teleported out. In other words we can't pass through an exit cell to another cell in the maze.

The 2d array of chars represents a birds eye view of the maze. We can move up, down, left, or right, but not diagonally in the maze. Your method shall return 2 if we can reach an exit cell in the maze after collection all the gold coins present, a 1 if we can reach an exit in the maze but without collecting all the gold coins, or a 0 if it is not possible to exit the maze at all.

Consider the following simple maze:

G$SGE

We start at the cell marked with an S. We move to the left one spot to the cell with the gold coin. We then move back to the right to our starting cell, to the right once more to the regular cell and then right to the exit. Given this maze our method shall return 2.

Consider the following maze:

$Y$SGE

We can't escape this maze while collecting all the gold coins. We can move left to pick up the first coin. When we move left again to the yellow cell. When we leave that cell it becomes impassable. ($*YGGE) We can get to the gold coin on the far left, but we are stuck there and can't exit the maze. We can exit the maze without picking up all the coins so the method shall, in this case, return 1.

Answer 1