![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DP
文章平均质量分 55
FrancisGeek的工作室
算法&设计模式
展开
-
Minimum Path Sum
Description: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原创 2017-01-02 21:49:39 · 182 阅读 · 0 评论 -
打家劫舍系列总结
Description: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 adj原创 2016-12-27 20:08:42 · 211 阅读 · 0 评论 -
Decode Ways
Description:A message containing letters from A-Z is being encoded to numbers using the following mapping:‘A—>1 ‘B’—>2 ….. ‘Z’—->26 Given an encoded message containing digits, determine the total n原创 2017-01-04 21:02:48 · 523 阅读 · 2 评论 -
Maximal Square
Description:Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.问题描述:给一个2-D数组,数组中的元素全为1或者0,在找这个矩阵中找到最大额一块正方形区域,这块正方形区域所满足的条件是里面的元素全为1,然后返回这原创 2017-01-05 20:32:19 · 181 阅读 · 0 评论 -
Word Break
Description:Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. Y原创 2017-01-06 22:00:53 · 195 阅读 · 0 评论 -
Maximum Subarray
Description:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.public int maxSubArray(int[] nums){}问题描述:给一给数组,找到这个数组的子数组(子数组连续),这个子数组是所有子数组中元素的和最大的,原创 2016-12-31 11:34:18 · 217 阅读 · 2 评论 -
Unique Paths
Description: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 r原创 2016-12-31 12:56:38 · 190 阅读 · 0 评论 -
Coin Change
Description:You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amoun原创 2017-01-08 21:42:49 · 168 阅读 · 0 评论