DynamicPrograming
文章平均质量分 55
ljffdream
这个作者很懒,什么都没留下…
展开
-
【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转载 2015-01-06 17:05:05 · 326 阅读 · 0 评论 -
【Leetcode】Minimum sum path
【题目】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转载 2015-09-01 11:30:47 · 214 阅读 · 0 评论 -
【Leetcode】maximum Rangtangle in 2D matrix
【题目】Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.【思路】只能说不明觉厉:The DP solution proceeds row by row, starting f转载 2015-09-02 11:10:29 · 309 阅读 · 0 评论 -
【Leetcode】Unique paths 2
【题目】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转载 2015-09-01 10:04:16 · 202 阅读 · 0 评论 -
【Leetcode】House Robber
【题目】You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adja转载 2015-07-02 16:24:31 · 239 阅读 · 0 评论 -
[Leetcode]House Robber2
[题目]Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. T转载 2015-07-08 09:15:07 · 506 阅读 · 0 评论 -
[Leetcode]Word Break
Given a string s and a dictionary of words dict, determine ifs can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet",转载 2015-06-10 10:40:27 · 283 阅读 · 0 评论 -
【Leetcode】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,转载 2014-12-05 17:30:17 · 572 阅读 · 0 评论 -
【LeetCode】Unique Binary Search Tree
【题目】Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2原创 2014-12-04 13:37:50 · 324 阅读 · 0 评论 -
【Leetcode】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], [转载 2015-09-04 11:08:48 · 327 阅读 · 0 评论