from one corner to another corner ,please get the shortest path numbers

any shortest path from squere(1,1) to squere(8.8),you can construct a sequence lick (u,u,u,r,r,r).

so you can use elemery combination to solve it. you need to choose a half numbers position to locate u or r,and anothers to locate u or r

猜你喜欢

转载自blog.csdn.net/qq_20949153/article/details/51959235
今日推荐