Package g0501_0600.s0521_longest_uncommon_subsequence_i

Class Solution

java.lang.Object
g0501_0600.s0521_longest_uncommon_subsequence_i.Solution
public class Solution extends Object
521 - Longest Uncommon Subsequence I.<p>Easy</p> <p>Given two strings <code>a</code> and <code>b</code>, return <em>the length of the <strong>longest uncommon subsequence</strong> between</em> <code>a</code> <em>and</em> <code>b</code>. If the longest uncommon subsequence does not exist, return <code>-1</code>.</p> <p>An <strong>uncommon subsequence</strong> between two strings is a string that is a <strong>subsequence of one but not the other</strong>.</p> <p>A <strong>subsequence</strong> of a string <code>s</code> is a string that can be obtained after deleting any number of characters from <code>s</code>.</p> <ul> <li>For example, <code>&quot;abc&quot;</code> is a subsequence of <code>&quot;aebdc&quot;</code> because you can delete the underlined characters in <code>&quot;aebdc&quot;</code> to get <code>&quot;abc&quot;</code>. Other subsequences of <code>&quot;aebdc&quot;</code> include <code>&quot;aebdc&quot;</code>, <code>&quot;aeb&quot;</code>, and <code>&quot;&quot;</code> (empty string).</li> </ul> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> a = &ldquo;aba&rdquo;, b = &ldquo;cdc&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> One longest uncommon subsequence is &ldquo;aba&rdquo; because &ldquo;aba&rdquo; is a subsequence of &ldquo;aba&rdquo; but not &ldquo;cdc&rdquo;. Note that &ldquo;cdc&rdquo; is also a longest uncommon subsequence.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> a = &ldquo;aaa&rdquo;, b = &ldquo;bbb&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> The longest uncommon subsequences are &ldquo;aaa&rdquo; and &ldquo;bbb&rdquo;.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> a = &ldquo;aaa&rdquo;, b = &ldquo;aaa&rdquo;</p> <p><strong>Output:</strong> -1</p> <p><strong>Explanation:</strong> Every subsequence of string a is also a subsequence of string b. Similarly, every subsequence of string b is also a subsequence of string a.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= a.length, b.length <= 100</code></li> <li><code>a</code> and <code>b</code> consist of lower-case English letters.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • findLUSlength

      public int findLUSlength(String a, String b)