Leetcode521. Longest Uncommon Subsequence I -- 最长非公共子序列 I

二十六画生的博客

于 2019-06-23 14:37:40 发布

阅读量398

点赞数

分类专栏：笔试面经 LeetCode 剑指Offer 后端/大数据文章标签： Leetcode521 Longest Uncommon Subsequence I 最长非公共子序列 I

本文链接：https://blog.youkuaiyun.com/u010002184/article/details/93381023

版权

笔试面经 LeetCode 剑指Offer 后端/大数据专栏收录该内容

226 篇文章 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

给定两个字符串，找出这两个字符串中最长的非公共子序列。非公共子序列是指它是其中一个字符串的子序列，但不能是其他字符串的子序列。如果最长非公共子序列不存在，则返回-1。题目中字符串长度不超过100，仅包含小写字母。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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: