521. Longest Uncommon Subsequence I
来源:互联网 发布:js点击滑动到相应div 编辑:程序博客网 时间:2024/05/21 18:00
题目描述【Leetcode】
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:
Both strings’ lengths will not exceed 100.
Only letters from a ~ z will appear in input strings.
这道题说了很多,其实很简单,就判断a与b是否相等,相等返回-1,不相等就返回a与b长度最长的那个
class Solution {public: int findLUSlength(string a, string b) { if(a == b) return -1; return max(a.length(),b.length()); }};
- 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
- 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
- 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
- 521. Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I
- Ext学习心得(一)
- block作为属性,作为参数,作为返回值各种情况演示
- java后台封装json数据(一)
- validate中添加焦点事件、键盘事件
- 2016年12月16日
- 521. Longest Uncommon Subsequence I
- 10 条提升 Android 性能的建议
- jsonp无X-Requested-With 及其深扒
- Node.js异步操作和CMD命令行下创建文件
- 获取当前文件夹的名字
- 为什么使用 NoSQL:NoSQL 与 SQL 的区别
- IntentService详解
- 卸载 Cloudera Manager 5.1.x.和 相关软件【官网翻译:高可用】
- java学习笔记(常量 二进制 其他进制 负数进制 变量 自动类型提升 强制类型转换 )