2018年8月6日
lintcode594 - strStr II - hard
摘要： Implement strStr function in O(n + m) time. strStr return the first index of the target string in a source string. The length of the target string is 阅读全文
posted @ 2018-08-06 13:35 jasminemzy 阅读(288) 评论(0) 推荐(0)
lintcode667 - Longest Palindromic Subsequence - medium
摘要： Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Example Given s = "bbba 阅读全文
posted @ 2018-08-06 07:32 jasminemzy 阅读(388) 评论(0) 推荐(0)