Leetcode 646. Maximum Length of Pair Chain

小白菜又菜

于 2024-07-05 21:43:26 发布

阅读量491

点赞数 5

分类专栏： Leetcode 动态规划（DP）解题报告文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/mobius_strip/article/details/140218708

版权

解题报告同时被 3 个专栏收录

1360 篇文章 4 订阅

订阅专栏

动态规划（DP）

212 篇文章 3 订阅

订阅专栏

Leetcode

138 篇文章 0 订阅

订阅专栏

Problem

Given 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.

Algorithm

Dynamic Programming (DP). Sort the data with a and b, define the state f(i) is the longest palindromic subsequence’s length, then
$max\{ f(j) + 1 \}, \quad if \quad sorted\_pairs[i][0] > sorted\_pairs[j][1]$

Code

class Solution:
    def findLongestChain(self, pairs: List[List[int]]) -> int:
        plen = len(pairs)
        dp = [1] * plen
        sorted_pairs = sorted(pairs, key=lambda x: (x[0], x[1]))
        for i in range(1, plen):
            for j in range(i):
                if sorted_pairs[i][0] > sorted_pairs[j][1] and dp[i] <= dp[j]:
                     dp[i] = dp[j] + 1
        
        return max(dp)