2016年09月_iyupaopao

09月 08月 07月 04月

原创 LeetCode进阶之路（Valid Number）

Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo

2016-09-22 23:03:26 293

原创 LeetCode进阶之路（Minimum Path Sum）

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.题目：还是寻找路径，不过这次是寻找最短的路径。思路：还是使用动态规划。public

2016-09-22 22:59:05 327

原创 LeetCode进阶之路（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

2016-09-22 22:52:54 255

原创 LeetCode进阶之路（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

2016-09-13 23:32:53 285