Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Leetcode: The Maze

Posted on May 15, 2018September 23, 2019 by braindenny

The Maze



Similar Problems:

  • CheatSheet: Leetcode For Code Interview
  • Tag: #bfs, #game, #inspiring, #manydetails

There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won’t stop rolling until hitting a wall. When the ball stops, it could choose the next direction.

Given the ball’s start position, the destination and the maze, determine whether the ball could stop at the destination.

The maze is represented by a binary 2D array. 1 means the wall and 0 means the empty space. You may assume that the borders of the maze are all walls. The start and destination coordinates are represented by row and column indexes.

Example 1

Input 1: a maze represented by a 2D array

0 0 1 0 0
0 0 0 0 0
0 0 0 1 0
1 1 0 1 1
0 0 0 0 0

Input 2: start coordinate (rowStart, colStart) = (0, 4)
Input 3: destination coordinate (rowDest, colDest) = (4, 4)

Output: true
Explanation: One possible way is : left -> down -> left -> down -> right -> down -> right

Leetcode: The Maze

Example 2

Input 1: a maze represented by a 2D array

0 0 1 0 0
0 0 0 0 0
0 0 0 1 0
1 1 0 1 1
0 0 0 0 0

Input 2: start coordinate (rowStart, colStart) = (0, 4)
Input 3: destination coordinate (rowDest, colDest) = (3, 2)

Output: false
Explanation: There is no way for the ball to stop at the destination.

Leetcode: The Maze

Note:

  1. There is only one ball and one destination in the maze.
  2. Both the ball and the destination exist on an empty space, and they will not be at the same position initially.
  3. The given maze does not contain border (like the red rectangle in the example pictures), but you could assume the border of the maze are all walls.
  4. The maze contains at least 2 empty spaces, and both the width and height of the maze won’t exceed 100.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


// https://code.dennyzhang.com/the-maze
// Basic Ideas: BFS
//
// Items to be explored would be positions which are near to walls
// Once visisted, mark it to 2
//
// Complexity: Time O(n), Space O(1)
type Node struct {
    x, y int
}

func hasPath(maze [][]int, start []int, destination []int) bool {
    queue := []Node{Node{start[0], start[1]}}
    x2, y2 := 0, 0
    for len(queue) != 0 {
        items := []Node{}
        for _, node := range queue {
            maze[node.x][node.y] = 2 // mark as visited
            for _, offset := range [][]int {{0, 1}, {0, -1}, {1, 0}, {-1, 0}} {
                    // move the wall in current direction
                    x2, y2 = node.x+offset[0], node.y+offset[1]
                    // We can't use maze[x2][y2] == 0. We can only stop by walls. Not visited nodes
                    for x2>=0 && x2<len(maze) && y2>=0 && y2<len(maze[0]) && maze[x2][y2] != 1 {
                        x2, y2 = x2+offset[0], y2+offset[1]
                    }
                    // move back
                    x2, y2 = x2-offset[0], y2-offset[1]
                    if x2==node.x && y2==node.y { continue }
                    if maze[x2][y2] == 0 {
                        if x2==destination[0] && y2==destination[1] { return true }
                        items = append(items, Node{x2, y2})
                    }
                }
        }
        queue = items
    }
    return false
}
linkedin
github
slack

Post Views: 8
Posted in MediumTagged #bfs, #game, #inspiring, #manydetails, redo

Post navigation

Leetcode: Number of Distinct Islands II
Leetcode: Construct Binary Tree from String

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #misc #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum baseconversion binarysearch concurrency editdistance hashmap knapsack monotone oodesign presum redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • Leetcode: Palindrome Partitioning III
  • Leetcode: Biggest Single Number
  • Leetcode: Max Consecutive Ones II
  • Leetcode: Minimum Cost to Connect Sticks
  • Leetcode: Minimum Swaps to Group All 1’s Together

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.