521. Longest Uncommon Subsequence I
Posted wx62ea2466cca9a
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了521. Longest Uncommon Subsequence I相关的知识,希望对你有一定的参考价值。
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:
Input: "aba", "cdc"
Output: 3
Explanation: The longest uncommon subsequence is "aba" (or "cdc"),
because "aba" is a subsequence of "aba",
but not a subsequence of any other strings in the group of two
Note:
Both strings’ lengths will not exceed 100.
Only letters from a ~ z will appear in input strings.
public class Solution
public int findLUSlength(String a, String b)
if (a.equals(b))
return -1;
return
以上是关于521. Longest Uncommon Subsequence I的主要内容,如果未能解决你的问题,请参考以下文章
521. Longest Uncommon Subsequence I
521. Longest Uncommon Subsequence I
521. Longest Uncommon Subsequence I
521. Longest Uncommon Subsequence I