摘要：
题目： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can yo 阅读全文
posted @ 2017-05-28 20:36
荒野第一快递员
阅读(739)
评论(0)
推荐(0)
摘要：
题目： 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 pa 阅读全文
posted @ 2017-05-28 20:05
荒野第一快递员
阅读(393)
评论(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 s 阅读全文
posted @ 2017-05-28 14:33
荒野第一快递员
阅读(487)
评论(3)
推荐(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 a 阅读全文
posted @ 2017-05-28 10:56
荒野第一快递员
阅读(241)
评论(1)
推荐(1)
浙公网安备 33010602011771号