学习之路

Palindrome Partitioning  I  Given 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 =

用动态规划的方法，就是要找到其转移方程式，也叫动态规划的递推式，动态规划的解法无非是维护两个变量，局部最优和全局最优。其中局部最优的意思就是到目前这个数字为止，其最好的值，整体最优就是整体的最好值。 例子： Maximum Product Subarray   Find the contiguous subarray within an array (containing

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 the