android unlock,Android Unlock Patterns

Android Unlock Patterns

这道题dfs做，关键是注意对称性，减少dfs次数。同时注意第3个条件 No jumps through non selected key is allowed. 这种情况发生在两个值的x和y差值没有1的时候，也就是abs(nx-x) == 2或者abs(nx - x) == 0，y也是同理。

public class Solution {

public int numberOfPatterns(int m, int n) {

/* subproblem: dp[depth][i][j] = sum(dp[depth + 1][ni][nj]) if valid

*/

int count = 0;

// start position: symmetry

// 1, 3, 7, 9 and 2, 4, 6, 8

boolean[][] visited = new boolean[3][3];

count += dfs(m, n, 0, 0, 1, visited) * 4;

count += dfs(m, n, 0, 1, 1, visited) * 4;

count += dfs(m, n, 1, 1, 1, visited);

return count;

}

private int dfs(int m, int n, int x, int y, int depth, boolean[][] visited) {

int count = 0;

if(depth == n) {

count++;

return count;

}

if(depth >= m) count++;

visited[x][y] = true;

// next step

for(int i = 0; i < 3; i++) {

for(int j = 0; j < 3; j++) {

if(!visited[i][j]) {

// previous position was not visited

if(Math.abs(i - x) != 1 && Math.abs(j - y) != 1 && !visited[(i+x)/2][(j+y)/2]) continue;

count += dfs(m, n, i, j, depth + 1, visited);

}

}

}

visited[x][y] = false;

return count;

}

}