Unique Paths III

On a 2-dimensional grid, there are 4 types of squares:

• 1 represents the starting square.  There is exactly one starting square.
• 2 represents the ending square.  There is exactly one ending square.
• 0 represents empty squares we can walk over.
• -1 represents obstacles that we cannot walk over.

Return the number of 4-directional walks from the starting square to the ending square, that walk over every non-obstacle square exactly once.

Example 1:

Input: [[1,0,0,0],[0,0,0,0],[0,0,2,-1]]
Output: 2
Explanation: We have the following two paths: 
1. (0,0),(0,1),(0,2),(0,3),(1,3),(1,2),(1,1),(1,0),(2,0),(2,1),(2,2)
2. (0,0),(1,0),(2,0),(2,1),(1,1),(0,1),(0,2),(0,3),(1,3),(1,2),(2,2)

Example 2:

Input: [[1,0,0,0],[0,0,0,0],[0,0,0,2]]
Output: 4
Explanation: We have the following four paths: 
1. (0,0),(0,1),(0,2),(0,3),(1,3),(1,2),(1,1),(1,0),(2,0),(2,1),(2,2),(2,3)
2. (0,0),(0,1),(1,1),(1,0),(2,0),(2,1),(2,2),(1,2),(0,2),(0,3),(1,3),(2,3)
3. (0,0),(1,0),(2,0),(2,1),(2,2),(1,2),(1,1),(0,1),(0,2),(0,3),(1,3),(2,3)
4. (0,0),(1,0),(2,0),(2,1),(1,1),(0,1),(0,2),(0,3),(1,3),(1,2),(2,2),(2,3)

Example 3:

Input: [[0,1],[2,0]]
Output: 0
Explanation: 
There is no path that walks over every empty square exactly once.
Note that the starting and ending square can be anywhere in the grid.

Note:

1. 1 <= grid.length * grid[0].length <= 20

思路：要走完所有的0，那么首先记录一下有多少个0，然后找到起始点，开始做dfs，这个就是backtracking，最后走到2的时候，step是0的个数+1，拿第一个例子就可以明白，把0走完了，最后走到2的时候，还算了一步，所以最后的步数step = empty + 1;

DFS是走到底了，也就是base case了，算1步骤，然后往上返回；为了避免cycle，直接把走过的0变成-1，这样省去了boolean数组，dfs完了，改回来0就可以了。(backtracking)

class Solution {
    public int uniquePathsIII(int[][] grid) {
        if(grid == null || grid.length == 0 || grid[0].length == 0) {
            return 0;
        }
        int n = grid.length; 
        int m = grid[0].length;
        int startX = 0; int startY = 0;
        int empty = 0;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                if(grid[i][j] == 1) {
                    startX = i;
                    startY = j;
                }
                if(grid[i][j] == 0) {
                    ++empty;
                }
            }
        }
        
        return dfs(grid, startX, startY, 0, empty);
    }
    
    private int[][] dirs = {{0,-1},{0,1},{1,0},{-1,0}};
    private int dfs(int[][] grid, int x, int y, int step, int empty) {
        if(x < 0 || x >= grid.length || y < 0 || y >= grid[0].length || grid[x][y] == -1) {
            return 0;
        }
        if(grid[x][y] == 2) {
            return step == empty + 1 ? 1 : 0;
        }
        grid[x][y] = -1;
        int count = 0;
        for(int[] dir: dirs) {
            int nx = x + dir[0];
            int ny = y + dir[1];
            count += dfs(grid, nx, ny, step + 1, empty);
        }
        grid[x][y] = 0;
        return count;
    }
}