Skip to content

docs: add a description of the solution to lc problem: No.0521 #736

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

Merged
merged 1 commit into from
Mar 5, 2022
Merged

docs: add a description of the solution to lc problem: No.0521 #736

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 10 additions & 0 deletions solution/0500-0599/0521.Longest Uncommon Subsequence I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -47,6 +47,16 @@

<!-- 这里可写通用的实现逻辑 -->

**此题最难之处是理解题目想描述的是什么玩意**。

假定： `a = "abc", b = "abb"`

要是说其中最长的相同子序列，便是 `ab`。

而特殊序列则是求**非子序列**，此时列举 `a` 的子序列 `"abc"`，`b` 拿不出来，那这就是一个成功的非子序列。

如此，在 `a != b` 时，谁最长谁就是 *最长的特殊序列*

<!-- tabs:start -->

### **Python3**
Expand Down