DP
别哔哔好伐
安静的coder
展开
-
leetcode-64-Minimum Path Sum
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 o原创 2015-07-08 19:06:46 · 601 阅读 · 0 评论 -
leetcode-198-House Robber
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 t原创 2015-07-29 10:50:48 · 477 阅读 · 0 评论 -
leetcode-53-Maximum Subarray
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 suba原创 2015-07-10 16:47:29 · 422 阅读 · 0 评论