leetcode 521. Longest Uncommon Subsequence I

野性酷女 2022-04-10 11:49 148阅读 0赞

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 strings.

**Note:**

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

最后真的是知道真相的我眼泪掉下来啊！

class Solution(object):
        def findLUSlength(self, a, b):
            """
            :type a: str
            :type b: str
            :rtype: int
            """
            return -1 if a == b else max(len(a), len(b))

发表评论取消回复

表情：

评论列表（有 0 条评论，148人围观）

还没有评论，来说两句吧...

相关阅读

相关 LeetCode - Medium - 1143. Longest Common Subsequence

Topic Dynamic Programming Description [https://leetcode.com/problems/longest-c

心已赠人/ 2022年10月22日 10:47/ 0 赞/ 126 阅读

相关 LeetCode300——Longest Increasing Subsequence

LeetCode300——Longest Increasing Subsequence 题意：最长上升子串，LIS问题，经典的动态规划问题。据说有用到二分的方法，这个还没

青旅半醒/ 2022年08月09日 19:30/ 0 赞/ 59 阅读

相关 leetcode 300. Longest Increasing Subsequence

Given an unsorted array of integers, find the length of longest increasing subsequence.

今天药忘吃喽~/ 2022年07月28日 01:20/ 0 赞/ 159 阅读

相关【codeforces 766A】Mahmoud and Longest Uncommon Subsequence

A. Mahmoud and Longest Uncommon Subsequence time limit per test 2 seconds memory limi

快来打我*/ 2022年07月12日 05:04/ 0 赞/ 116 阅读

相关【Leetcode】521. Longest Uncommon Subsequence I

思路：比较两个字符串的长度，若不相等，则返回长度的较大值，若相等则再判断两个字符串是否相同，若相同则返回-1，否则返回长度。 public class Solut

淡淡的烟草味﹌/ 2022年07月03日 12:55/ 0 赞/ 150 阅读

相关 leetcode 522. Longest Uncommon Subsequence II 最长非公共子序列 + 暴力寻找子串

Given a list of strings, you need to find the longest uncommon subsequence among them. T

今天药忘吃喽~/ 2022年06月03日 03:16/ 0 赞/ 169 阅读

相关 leetcode 521. Longest Uncommon Subsequence I 最初非公共子序列 + 直接比较即可

Given a group of two strings, you need to find the longest uncommon subsequence of this

叁歲伎倆/ 2022年06月03日 03:15/ 0 赞/ 141 阅读

相关 521. Longest Uncommon Subsequence I

[原题链接][Link 1] 1 蛮力破解（Time Limit Exceeded）暴力破解方式将会生成所有的 2n个子序列。并且将他们的复现次数也一同存储到hash

左手的ㄟ右手/ 2022年06月02日 00:29/ 0 赞/ 115 阅读

相关 LeetCode:521. Longest Uncommon Subsequence I(找出特殊的子字符串)

> 文章最前：我是Octopus，这个名字来源于我的中文名--章鱼；我热爱编程、热爱算法、热爱开源。所有源码在我的个人[github][] ；这博客是记录我学习的点点滴滴，如

素颜马尾好姑娘i/ 2022年04月22日 12:44/ 0 赞/ 139 阅读

相关 leetcode 521. Longest Uncommon Subsequence I

Given a group of two strings, you need to find the longest uncommon subsequence of this

野性酷女/ 2022年04月10日 11:49/ 0 赞/ 149 阅读