- 博客(2)
- 收藏
- 关注
原创 Dynamic Programing -- Leetcode problem 63. 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.
2017-11-02 15:31:50 165
原创 Dynamic Programing -- Leetcode problem 62. 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 b
2017-11-02 14:49:20 226
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人