[leetcode]: 521. Longest Uncommon Subsequence I
来源:互联网 发布:阿里云客服是什么 编辑:程序博客网 时间:2024/05/23 01:16
1.题目描述
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.
求两个字符串最长的非公共子序列
2.分析
一开始想复杂了。【最长】【非公共】
如果两个字符串不相同,那么最长非公共就是较长的那个字符串,如果相同,答案就是-1
3.代码
int findLUSlength(string a, string b) { if(a==b) return -1; return max(a.size(),b.size());}
- leetcode 521. Longest Uncommon Subsequence I
- 【Leetcode】521. Longest Uncommon Subsequence I
- LeetCode 521. Longest Uncommon Subsequence I
- [LeetCode]521. Longest Uncommon Subsequence I
- leetcode 521. Longest Uncommon Subsequence I
- [leetcode]: 521. Longest Uncommon Subsequence I
- [leetcode]521. Longest Uncommon Subsequence I
- [LeetCode]521. Longest Uncommon Subsequence I
- LeetCode: 521. Longest Uncommon Subsequence I
- [leetcode]521. Longest Uncommon Subsequence I
- LeetCode-521. Longest Uncommon Subsequence I
- [LeetCode] 521. Longest Uncommon Subsequence I
- <leetcode> 521. Longest Uncommon Subsequence I
- LeetCode 521. Longest Uncommon Subsequence I
- [LeetCode]521. Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I(leetcode)
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- ZZULIOJ 2130 hipercijevi【Bfs+FastIO】卡FastIO和Vector好无聊啊-
- 关于MVC中使用JqGrid插件分页时无法显示分页按钮(首页、上一页、下一页、最后一页)的原因
- 跨平台多核多线程编程指南
- 【算法-java】判断该数组是不是某二叉搜索树的后序遍历的结果
- <a>标签href链接类型及作用
- [leetcode]: 521. Longest Uncommon Subsequence I
- 银行家算法(文件读入输出)
- Redis文档链接(含官方中文)
- css小细节罗列
- CSS3标准中nth-child()用法
- 使用 Office 365 PowerShell 管理用户帐户和许可证(六)
- 【Shader】用 Shader 画点和线
- jfreechart简单介绍1---条形图
- 微信小程序 tabBar