摘要：
Given a m x n grid filled with non negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2017-04-10 13:56
aiterator
阅读(92)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2017-04-10 13:44
aiterator
阅读(103)
评论(0)
推荐(0)
摘要：
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 p 阅读全文
posted @ 2017-04-10 13:41
aiterator
阅读(107)
评论(0)
推荐(0)
浙公网安备 33010602011771号