最长回文子串
摘要：
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: "b 阅读全文
posted @ 2017-10-09 23:03 Peyton_Li 阅读(182) 评论(0) 推荐(0) 编辑
最长的无重复字母的子串
摘要：
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
posted @ 2017-10-09 14:53 Peyton_Li 阅读(197) 评论(0) 推荐(0) 编辑