dp1 [LeetCode] 516. Longest Palindromic Subsequence (golang) 문제Longest Palindromic Subsequence - LeetCodeGiven a string s, find the longest palindromic subsequence's length in s. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. Example 1: Input: s = "bbbab"Output: 4Explanation: One possible longest palindromic subsequence is "bbbb".https://leetco.. 2021. 6. 14. 이전 1 다음
