2018年6月2日
*5. Longest Palindromic Substring (dp) previous blogs are helpful
摘要： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: 阅读全文
posted @ 2018-06-02 12:23 wz30 阅读(123) 评论(0) 推荐(0) 编辑
*459. Repeated Substring Pattern (O(n^2)) two pointers could be better?
摘要： Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may a 阅读全文
posted @ 2018-06-02 10:41 wz30 阅读(204) 评论(0) 推荐(0) 编辑