Create a maze （ Complexity alpha Is the ratio of the wall to the total cells of the maze ）
Maze to n×n Of 0-1 The matrix representation of , among 1 Represents a wall ,0 Means passable
The labyrinth entrance is （0,0）, The exit is （n-1,n-1）, The walking direction is up, down, left and right
It is required to output the shortest feasible path
If there are multiple shortest paths , Then output them all