Formatted question description: https://leetcode.ca/all/489.html

# 489. Robot Room Cleaner (Hard)

Given a robot cleaner in a room modeled as a grid.

Each cell in the grid can be empty or blocked.

The robot cleaner with 4 given APIs can move forward, turn left or turn right. Each turn it made is 90 degrees.

When it tries to move into a blocked cell, its bumper sensor detects the obstacle and it stays on the current cell.

Design an algorithm to clean the entire room using only the 4 given APIs shown below.

interface Robot {
// returns true if next cell is open and robot moves into the cell.
// returns false if next cell is obstacle and robot stays on the current cell.
boolean move();

// Robot will stay on the same cell after calling turnLeft/turnRight.
// Each turn will be 90 degrees.
void turnLeft();
void turnRight();

// Clean the current cell.
void clean();
}


Example:

Input:
room = [
[1,1,1,1,1,0,1,1],
[1,1,1,1,1,0,1,1],
[1,0,1,1,1,1,1,1],
[0,0,0,1,0,0,0,0],
[1,1,1,1,1,1,1,1]
],
row = 1,
col = 3

Explanation:
All grids in the room are marked by either 0 or 1.
0 means the cell is blocked, while 1 means the cell is accessible.
The robot initially starts at the position of row=1, col=3.
From the top left corner, its position is one row below and three columns right.


Notes:

1. The input is only given to initialize the room and the robot's position internally. You must solve this problem "blindfolded". In other words, you must control the robot using only the mentioned 4 APIs, without knowing the room layout and the initial robot's position.
2. The robot's initial position will always be in an accessible cell.
3. The initial direction of the robot will be facing up.
4. All accessible cells are connected, which means the all cells marked as 1 will be accessible by the robot.
5. Assume all four edges of the grid are all surrounded by wall.

Companies:

Related Topics:
Depth-first Search

Similar Questions:

## Solution 1.

// OJ: https://leetcode.com/problems/robot-room-cleaner/
// Time: O(MN) where M and N are the width and height of the room.
// Space: O(MN)
class Solution {
private:
int dirs = { {0, 1}, {1, 0}, {0, -1}, {-1, 0} };
unordered_map<int, unordered_set<int>> seen;
void dfs(Robot& robot, int x, int y, int dir) {
for (int i = 0; i < 4; ++i, robot.turnRight(), dir = (dir + 1) % 4) {
int nx = x + dirs[dir];
int ny = y + dirs[dir];
if (seen[nx].find(ny) != seen[nx].end()) continue;
seen[nx].insert(ny);
bool movable = robot.move();
if (!movable) continue;
robot.clean();
dfs(robot, nx, ny, dir);
}
robot.turnRight();
robot.turnRight();
robot.move();
robot.turnRight();
robot.turnRight();
}
public:
void cleanRoom(Robot& robot) {
robot.clean();
seen.insert(0);
dfs(robot, 0, 0, 0);
}
};


Java

• /**
* // This is the robot's control interface.
* // You should not implement it, or speculate about its implementation
* interface Robot {
*     // Returns true if the cell in front is open and robot moves into the cell.
*     // Returns false if the cell in front is blocked and robot stays in the current cell.
*     public boolean move();
*
*     // Robot will stay in the same cell after calling turnLeft/turnRight.
*     // Each turn will be 90 degrees.
*     public void turnLeft();
*     public void turnRight();
*
*     // Clean the current cell.
*     public void clean();
* }
*/
class Solution {
final int WHITE = 0;
final int GRAY = 1;
final int BLACK = 2;
int[][] directions = { {-1, 0}, {0, 1}, {1, 0}, {0, -1} };

public void cleanRoom(Robot robot) {
Map<String, Integer> visitedMap = new HashMap<String, Integer>();
visitedMap.put(Arrays.toString(new int[]{0, 0}), GRAY);
int directionIndex = 0;
depthFirstSearch(robot, directionIndex, visitedMap, 0, 0);
}

public void depthFirstSearch(Robot robot, int directionIndex, Map<String, Integer> visitedMap, int row, int column) {
robot.clean();
for (int i = 0; i < 4; i++) {
int[] direction = directions[directionIndex];
int newRow = row + direction, newColumn = column + direction;
int[] newCell = {newRow, newColumn};
int color = visitedMap.getOrDefault(Arrays.toString(newCell), WHITE);
if (color == WHITE && robot.move()) {
visitedMap.put(Arrays.toString(newCell), GRAY);
depthFirstSearch(robot, directionIndex, visitedMap, newRow, newColumn);
for (int j = 0; j < 2; j++)
robot.turnRight();
robot.move();
for (int j = 0; j < 2; j++)
robot.turnRight();
}
robot.turnRight();
directionIndex = (directionIndex + 1) % 4;
}
visitedMap.put(Arrays.toString(new int[]{row, column}), BLACK);
}
}

• // OJ: https://leetcode.com/problems/robot-room-cleaner/
// Time: O(MN) where M and N are the width and height of the room.
// Space: O(MN)
class Solution {
private:
int dirs = { {0, 1}, {1, 0}, {0, -1}, {-1, 0} };
unordered_map<int, unordered_set<int>> seen;
void dfs(Robot& robot, int x, int y, int dir) {
for (int i = 0; i < 4; ++i, robot.turnRight(), dir = (dir + 1) % 4) {
int nx = x + dirs[dir];
int ny = y + dirs[dir];
if (seen[nx].find(ny) != seen[nx].end()) continue;
seen[nx].insert(ny);
bool movable = robot.move();
if (!movable) continue;
robot.clean();
dfs(robot, nx, ny, dir);
}
robot.turnRight();
robot.turnRight();
robot.move();
robot.turnRight();
robot.turnRight();
}
public:
void cleanRoom(Robot& robot) {
robot.clean();
seen.insert(0);
dfs(robot, 0, 0, 0);
}
};

• print("Todo!")