Package g0501_0600.s0522_longest_uncommon_subsequence_ii

Class Solution

java.lang.Object

g0501_0600.s0522_longest_uncommon_subsequence_ii.Solution

public class Solution
extends Object

522 - Longest Uncommon Subsequence II\. Medium Given an array of strings `strs`, return _the length of the **longest uncommon subsequence** between them_. If the longest uncommon subsequence does not exist, return `-1`. An **uncommon subsequence** between an array of strings is a string that is a **subsequence of one string but not the others**. A **subsequence** of a string `s` is a string that can be obtained after deleting any number of characters from `s`. * For example, `"abc"` is a subsequence of `"aebdc"` because you can delete the underlined characters in `"aebdc"` to get `"abc"`. Other subsequences of `"aebdc"` include `"aebdc"`, `"aeb"`, and `""` (empty string). **Example 1:** **Input:** strs = ["aba","cdc","eae"] **Output:** 3 **Example 2:** **Input:** strs = ["aaa","aaa","aa"] **Output:** -1 **Constraints:** * `2 <= strs.length <= 50` * `1 <= strs[i].length <= 10` * `strs[i]` consists of lowercase English letters.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	findLUSlength(String[] strs)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findLUSlength

public int findLUSlength(String[] strs)