## 问题描述

Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be **any** subsequence of the other strings.

A **subsequence** is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements. Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.

The input will be two strings, and the output needs to be the length of the longest uncommon subsequence. If the longest uncommon subsequence doesn't exist, return -1.

**Example 1:**

1 | Input: "aba", "cdc" |

**Note:**

- Both strings' lengths will not exceed 100.
- Only letters from a ~ z will appear in input strings.

**Related Topics:** String

原问题：521. Longest Uncommon Subsequence I

中文翻译版：521. 最长特殊序列 Ⅰ

## 解决方案

这道题粗看以为是一道很难的题目，但是解决该问题只需要考虑三种情况：

- \(a = b\) If both the strings are identical, it is obvious that no subsequence will be uncommon. Hence, return -1.
- \(length(a) = length(b)\) and \(a \ne b\) Example: \(abc\) and \(abd\). In this case we can consider any string i.e. \(abc\) or \(abd\) as a required subsequence, as out of these two strings one string will never be a subsequence of other string. Hence, return \(length(a)\) or \(length(b)\).
- \(length(a) \ne length(b)\) Example: \(abcd\) and \(abc\). In this case we can consider bigger string as a required subsequence because bigger string can't be a subsequence of smaller string. Hence, return \(\max{(length(a), length(b))}\).

贴上实现代码

1 | #include <iostream> |