2019年5月23日
leetCode 5. 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 1: Example 2: 动态规划解法：d[i][ 阅读全文
posted @ 2019-05-23 20:27 赤云封天 阅读(111) 评论(0) 推荐(0)
leetCode 3. Longest Substring Without Repeating Characters
摘要： Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2019-05-23 11:18 赤云封天 阅读(193) 评论(0) 推荐(0)