2020年2月9日
leetcode 516. Longest Palindromic Subsequence
摘要： 题目内容 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: 分析过程 题目归类 阅读全文
posted @ 2020-02-09 17:00 clnsx 阅读(88) 评论(0) 推荐(0) 编辑
leetcode 5. 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: 分析过程 题目归类： array,dp 阅读全文
posted @ 2020-02-09 12:32 clnsx 阅读(98) 评论(0) 推荐(0) 编辑