演算法›Ch3 動態規劃
第 9 題/共 40 題
◀ AL 9/40
9. Dynamic Programming、Longest Palindromic Subsequence
#AL-03-009中Dynamic ProgrammingLongest Palindromic Subsequence

Given a string, write a pseudocode function that finds the longest subsequence of a string that is a palindrome.

📄 台大111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃
本章題號 · 1–20 / 40