2020年12月2日
516. 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 1:Input: "bbbab 阅读全文
posted @ 2020-12-02 16:23 Yancea 阅读(48) 评论(0) 推荐(0) 编辑
1143. Longest Common Subsequence(Medium)
摘要： Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated from the 阅读全文
posted @ 2020-12-02 14:39 Yancea 阅读(99) 评论(0) 推荐(0) 编辑