w********0
发帖数: 377 | 1 find all different android lock screen combinations with length of 5 in a n*
n array.
The conditions are 1) just like drawing on the n*n array, once you put down
your pencil you cannot poll it up to select next number; 2) all the 5
numbers should be different; 3) the path can overlap when you go to the
other direction; 4) cannot jump over number, the next number is adjacent to
previous number, but may not be the last selected number due to overlapping
path.
求解题思路，谢谢！ | x*******e
发帖数: 84 | 2 dfs
n*
down
to
overlapping
【在 w********0 的大作中提到】
: find all different android lock screen combinations with length of 5 in a n*
: n array.
: The conditions are 1) just like drawing on the n*n array, once you put down
: your pencil you cannot poll it up to select next number; 2) all the 5
: numbers should be different; 3) the path can overlap when you go to the
: other direction; 4) cannot jump over number, the next number is adjacent to
: previous number, but may not be the last selected number due to overlapping
: path.
: 求解题思路，谢谢！
|
|
