摘要: 1. Question Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k tim 阅读全文
posted @ 2017-11-05 11:43 清水汪汪 阅读(199) 评论(0) 推荐(0) 编辑
摘要: 1. Question 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: 阅读全文
posted @ 2017-11-05 09:38 清水汪汪 阅读(159) 评论(0) 推荐(0) 编辑
摘要: 1. Question Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the gi 阅读全文
posted @ 2017-11-05 08:57 清水汪汪 阅读(163) 评论(0) 推荐(0) 编辑