substring
gexlei
这个作者很懒,什么都没留下…
展开
-
Longest Substring Without Repeating Characters
题目 Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the ans转载 2016-12-02 20:04:19 · 262 阅读 · 0 评论 -
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. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answ转载 2016-12-12 18:48:50 · 1188 阅读 · 1 评论