Mate2到底咋样啊# PDA - 掌中宝
d*n
1 楼
A robot is located at the top-left corner of a m x n grid (marked 'Start' in
the diagram below).
The robot can only move either down or right at any point in time. The robot
is trying to reach the bottom-right corner of the grid (marked 'Finish' in
the diagram below).
How many possible unique paths are there?
这个用递归judge small可以通过,但是judge large给出timelimit exceeded at (23,
12),有没有比递归更好的方法?
the diagram below).
The robot can only move either down or right at any point in time. The robot
is trying to reach the bottom-right corner of the grid (marked 'Finish' in
the diagram below).
How many possible unique paths are there?
这个用递归judge small可以通过,但是judge large给出timelimit exceeded at (23,
12),有没有比递归更好的方法?