09 2019 档案
摘要:Question Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated
阅读全文
摘要:Question Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. 即求最长回文子串(注意和最长回文子序列的区别,子串
阅读全文