leetcode dynamic programming
proudmore
这个作者很懒,什么都没留下…
展开
-
Leetcode Regular expression matching
Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element.The matching should cover the entire input原创 2015-03-25 05:00:06 · 155 阅读 · 0 评论 -
Leetcode House Robber I, II
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 adjacent houses原创 2015-05-08 02:02:51 · 142 阅读 · 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 adjacent houses原创 2015-05-08 01:58:43 · 223 阅读 · 0 评论 -
Leetcode Wildcard matching
Implement wildcard pattern matching with support for ‘?’ and ‘*’. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence).The matching should cover原创 2015-03-25 13:55:32 · 174 阅读 · 0 评论 -
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. Note: You can only move either down or right at an原创 2015-03-25 14:05:44 · 212 阅读 · 0 评论 -
Leetcode Longest valid parentheses
Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring. For “(()”, the longest valid parentheses substring is “()”, which h原创 2015-03-25 12:52:47 · 129 阅读 · 0 评论 -
Leetcode Word break I, II
Word break IGiven a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = “leetcode”原创 2015-03-31 14:08:57 · 140 阅读 · 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], [3,4], [6,5,7],原创 2015-03-24 14:23:38 · 121 阅读 · 0 评论 -
Leetcode Distinct subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting some (can be none)原创 2015-03-29 09:14:43 · 160 阅读 · 0 评论 -
Leetcode Dungeon game
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially posi原创 2015-04-03 02:54:10 · 186 阅读 · 0 评论 -
Leetcode Palindrome partition I,II
Palindrome partition IGiven a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = “aab”, Return原创 2015-03-31 12:08:19 · 186 阅读 · 0 评论 -
Leetcode Interleaving string
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given: s1 = “aabcc”, s2 = “dbbca”, When s3 = “aadbbcbcac”, return true. When s3 = “aadbbbaccc”, r原创 2015-03-29 08:41:09 · 182 阅读 · 0 评论 -
Leetcode Scramble string
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = “great”: great / \ gr eat原创 2015-03-29 01:34:27 · 187 阅读 · 0 评论 -
Leetcode Decode ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26Given an encoded message containing digits, determine the total n原创 2015-03-29 02:19:10 · 127 阅读 · 0 评论 -
Leetcode Maximal rectangle
public class Solution { public int maximalRectangle(char[][] matrix) { if(matrix==null || matrix.length==0 || matrix[0].length==0)return 0; int m=matrix.length, n=matrix[0].length;原创 2015-03-28 05:04:50 · 140 阅读 · 0 评论 -
Leetcode Edit distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a) In原创 2015-03-28 06:08:14 · 120 阅读 · 0 评论 -
Leetcode Climbing stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?public class Solution { public原创 2015-03-25 14:08:13 · 119 阅读 · 0 评论 -
Leetcode Maximal square
Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing all 1’s and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0Return 4.原创 2015-06-07 07:45:20 · 209 阅读 · 0 评论