2018年3月24日
【LeetCode】005. 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: Example: 题解： Solution 1 暴 阅读全文
posted @ 2018-03-24 13:33 Vincent丶丶 阅读(241) 评论(0) 推荐(0)
【LeetCode】003. 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 leng 阅读全文
posted @ 2018-03-24 01:01 Vincent丶丶 阅读(163) 评论(0) 推荐(0)