JuniorString
Longest Uncommon Subsequence I
Given two strings a and b, return the length of the longest uncommon subsequence between a and b. If no such uncommon subsequence exists, return -1.
An uncommon subsequence between two strings is a string that is a subsequence of exactly one of them.
Example 1
Input
a = "aba", b = "cdc"Output
3One longest uncommon subsequence is "aba" because "aba" is a subsequence of "aba" but not "cdc"; "cdc" is also a longest uncommon subsequence.
Example 2
Input
a = "aaa", b = "bbb"Output
3The longest uncommon subsequences are "aaa" and "bbb".
Constraints
- 1 <= a.length, b.length <= 100
- a and b consist of lower-case English letters.