动态规划
文章平均质量分 52
candy_crush
胡编乱写
展开
-
Unique Paths和Unique Paths II 路径
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-08-22 17:03:55 · 240 阅读 · 0 评论 -
Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha原创 2016-08-20 21:16:12 · 169 阅读 · 0 评论 -
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. Note: You can only move either down or right at原创 2016-08-22 19:26:54 · 1306 阅读 · 0 评论 -
Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2], [3,4], [原创 2016-09-03 10:57:16 · 215 阅读 · 0 评论