演算法›Ch3 動態規劃第 18 題／共 40 題
18. Dynamic Programming、Longest Palindromic Subsequence
#AL-03-018中Dynamic ProgrammingLongest Palindromic Subsequence
- (6%). A palindrome is a non-empty string over some alphabet that reads the same forward and backward. Examples of palindromes are all strings of length 1, civic, racecar, and aibohphobia. Give an efficient (polynomial-time) algorithm to find the longest palindrome that is a subsequence of a given input string. For example, given the input character, your algorithm should return carac. What is the time complexity of your algorithm?
📄 交大114
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃