New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Title: 求出最长好子序列 II(Find the Maximum Length of a Good Subsequence II) #281

Open

github-actions bot opened this issue Sep 7, 2024 · 0 comments

Labels

github-actions bot commented Sep 7, 2024

Difficulty: Hard
Tags: 数组(Array)、哈希表(Hash Table)、动态规划(Dynamic Programming)
Link: https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-ii
LinkCN: https://leetcode.cn/problems/find-the-maximum-length-of-a-good-subsequence-ii

github-actions bot added the leetcode label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment