记录点滴

题目：Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11 1 1 1 1

原题链接: http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/ 为什么不能用 dp[i][j] = max(dp[i-1][j-1], dp[i-1][j] + diff) 参考：http://liangjiabin.com/blog/2015/04/leetcode-best-time-to-buy-a

题目：Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching shoul

题目 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

思路：dp[i][j] 表示s的前i个字符和p的前j个字符是否匹配。if s[0..i-1] matches p[0..j-1]如果 p[j - 1] != '*' 那么 dp[i][j] = dp[i - 1][j - 1] && (p[j - 1] == s[j - 1] || p[j - 1] == '.')如果 p[j - 1] == '*' 第一种情况：p[j - 2]重

题目：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

题目：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 (c

题目：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 = "aadbbba

题目：Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown bel

题目：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

题目：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

题目：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 / \

题目：Given two numbers represented as strings, return multiplication of the numbers as a string.Note:The numbers can be arbitrarily large and are non-negative.Converting the input string

题目：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 o

题目：Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = "aab"