2016年5月15日

LintCode : Unique Paths II
摘要： Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid. 阅读全文
posted @ 2016-05-15 21:03 dingjunnan 阅读(153) 评论(0) 推荐(0) 编辑
LintCode : Unique Paths
摘要： 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? 阅读全文
posted @ 2016-05-15 20:42 dingjunnan 阅读(124) 评论(0) 推荐(0) 编辑

导航