摘要：
Problem statement Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example 阅读全文
posted @ 2017-05-09 09:17
蓝色地中海
阅读(129)
评论(0)
推荐(0)
摘要：
Problem statement: Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Exam 阅读全文
posted @ 2017-05-09 07:58
蓝色地中海
阅读(183)
评论(0)
推荐(0)
摘要：
Problem statement: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrang 阅读全文
posted @ 2017-05-09 07:04
蓝色地中海
阅读(134)
评论(0)
推荐(0)
浙公网安备 33010602011771号