351 Android Unlock Patterns
Given an Android 3x3 key lock screen and two integers m and n, where 1 ≤ m ≤ n ≤ 9, count the total number of unlock patterns of the Android lock screen, which consist of minimum of m keys and maximum n keys.
Rules for a valid pattern:
- 1.Each pattern must connect at least m keys and at most n keys.
- 2.All the keys must be distinct.
- 3.If the line connecting two consecutive keys in the pattern passes through any other keys, the other keys must have previously selected in the pattern. No jumps through non selected key is allowed.
- 4.The order of keys used matters.
Explanation:
| 1 | 2 | 3 |
| 4 | 5 | 6 |
| 7 | 8 | 9 |
Invalid move:
4 - 1 - 3 - 6
Line 1 - 3 passes through key 2 which had not been selected in the pattern.Invalid move:
4 - 1 - 9 - 2
Line 1 - 9 passes through key 5 which had not been selected in the pattern.Valid move:
2 - 4 - 1 - 3 - 6
Line 1 - 3 is valid because it passes through key 2, which had been selected in the patternValid move:
6 - 5 - 4 - 1 - 9 - 2
Line 1 - 9 is valid because it passes through key 5, which had been selected in the pattern.Example:
Given m= 1,n= 1, return 9.
(1) Backtracking
public class Solution {
public int numberOfPatterns(int m, int n) {
// Skip represents the number to skip between two numbers
int[][] skip = new int[10][10];
skip[1][3] = skip[3][1] = 2;
skip[7][9] = skip[9][7] = 8;
skip[1][7] = skip[7][1] = 4;
skip[3][9] = skip[9][3] = 6;
skip[1][9] = skip[9][1] = skip[3][7] = skip[7][3] = skip[2][8] = skip[8][2]
= skip[4][6] = skip[6][4] = 5;
boolean[] visited = new boolean[10];
int res = 0;
for (int i = m; i <= n; i++) {
res += searchPatterns(visited, skip, 1, i - 1) * 4; // 1, 3, 7, 9 are symmetric
res += searchPatterns(visited, skip, 2, i - 1) * 4; // 2, 4, 6, 8 are symmetric
res += searchPatterns(visited, skip, 5, i - 1);
}
return res;
}
public int searchPatterns(boolean[] visited, int[][] skip, int curNum, int steps) {
if (steps == 0) {
return 1;
}
visited[curNum] = true;
int res = 0;
for (int nextNum = 1; nextNum <= 9; nextNum++) {
// if nextNum is not visited and (curNum is adjacent to nextNum or their skip number is visited)
if (!visited[nextNum] && (skip[curNum][nextNum] == 0 || visited[skip[curNum][nextNum]])) {
res += searchPatterns(visited, skip, nextNum, steps - 1);
}
}
visited[curNum] = false;
return res;
}
}
Backtracking: 时间复杂度O(n!), n是pattern的最长长度 ,空间复杂度O(n), 递归的深度最 多为n
Last modified 3yr ago