H*M
发帖数: 1268 | 1 Coding: Jig saw puzzle. What are the data structures? Assume you have some m
ethod which can tell you if two pieces fit together. How would you solve the
puzzle, minimizing the number of times you have to call that function?
我查了下，jigsaw大概就是小图，四边，每边有可能有个凸起或者凹陷
让拼成大图。 |
H*M
发帖数: 1268 | 2 ft..
为啥没人讨论这个问题...
m
the
【在 H*M 的大作中提到】
: Coding: Jig saw puzzle. What are the data structures? Assume you have some m
: ethod which can tell you if two pieces fit together. How would you solve the
: puzzle, minimizing the number of times you have to call that function?
: 我查了下，jigsaw大概就是小图，四边，每边有可能有个凸起或者凹陷
: 让拼成大图。
|
s***t
发帖数: 49 | 3 struct Piece
{
leftedge;
rightedge;
topedge;
bottonedge;
posi_x;
posi_y;
}
【在 H*M 的大作中提到】
: ft..
: 为啥没人讨论这个问题...
:
: m
: the
|
r*********n
发帖数: 33 | 4
【在 H*M 的大作中提到】
: ft..
: 为啥没人讨论这个问题...
:
: m
: the
|
