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

来源:互联网 发布:sql去重复列名 编辑:程序博客网 时间:2024/06/04 19:44
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
0 0