Easy-16
2017-05-03 22:18
99 查看
leetcode 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:
Note:
Both strings' lengths will not exceed 100.
Only letters from a ~ z will appear in input strings.
AC:
int findLUSlength(char* a, char* b) {
int len1=strlen(a);
int len2=strlen(b);
if(len1!=len2)
{
return len1>len2?len1:len2;
}
if(strstr(a,b)==NULL)
{
return len1;
}else
{
return -1;
}
}
tip:最开始看标题,以为是动态规划类的题目,后来发现这个题目有点nc。。。搞笑的吧。。。
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.
AC:
int findLUSlength(char* a, char* b) {
int len1=strlen(a);
int len2=strlen(b);
if(len1!=len2)
{
return len1>len2?len1:len2;
}
if(strstr(a,b)==NULL)
{
return len1;
}else
{
return -1;
}
}
tip:最开始看标题,以为是动态规划类的题目,后来发现这个题目有点nc。。。搞笑的吧。。。
相关文章推荐
- Easy 16 Sqrt(x)(69)
- Easy-题目16:328. Odd Even Linked List
- 2017年5月7日 16:01:40 67. Add Binary【easy】
- [高中数学联赛题] Codeforces Gym 101173 CERC 16 E. Easy Equation
- 16、层次遍历二叉树
- Oracle——16用户、角色和权限
- Easy-题目28:27.Remove Element
- 阿里云ubuntu16 lnmp配置
- cocos2d-x游戏实例(16)-纵版射击游戏(3)
- python管理工具easy_install与pip
- Easy-题目44:19. Remove Nth Node From End of List
- 16.计算最接近目标值的和
- 2012 3 16
- Python使用easy-install安装时报UnicodeDecodeError的解决方法
- Easy-题目59:204. Count Primes
- UTF-16 UTF-8
- curl_easy_setopt常用设置选项
- Windows 下 Python easy_install 的安装
- [easy]【leetcode】【java】 Intersection of Two Arrays II 两个数组的交集
- Java后台之路(16)-代理、反射等