动态规划
TzyProgram
见证技术成长.C
展开
-
Leetcode_Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.原创 2014-07-23 10:03:01 · 289 阅读 · 0 评论 -
Leetcode_LongestSubstringWithoutRepeatingCharacters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo原创 2014-07-23 10:16:15 · 303 阅读 · 0 评论