登录
  • #刷题
  • #careercup

【第三轮】8.3-8.9 CareerCup 9.2

林微熙
1352
10
9.2 Imagine a robot sitting on the upper left comer of an X by Ygrid. The robot can only move in two directions: right and down. How many possible paths are there for the

robot to go from (0, 0) to (X, Y) ?

FOLLOW UP

Imagine certain spots are "off limits," such that the robot cannot step on them.

Design an algorithm to find a path for the robot from the top left to the bottom right.





回复解法可以按照以下格式来

[indent][indent]【解题思路】

【时间复杂度】

【空间复杂度】

【gist link】

---------------OPTional,如果觉得test case比较好,欢迎写出来分享----------------------

【test case】[/indent]
[/indent]
10条回复
热度排序

发表回复