Easy-16
来源:互联网 发布:国外手机号码数据库 编辑:程序博客网 时间:2024/05/19 02:06
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 beany 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: 3Explanation: 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
- easy
- Easy
- Easy 16 Sqrt(x)(69)
- LeetCode-Easy刷题(16) Climbing Stairs
- 算法第16周Maximum Subarray[easy]
- Easy way for 16, 8 , 2 decimal switch 10 decimal.
- Easy way for 10 decimal switch 16 decimal
- 16进制转10进制(最easy的做法)
- Easy-题目16:328. Odd Even Linked List
- Easy Plugs
- easy problem
- So Easy!
- so easy
- easy explorer
- Easy Explore
- Easy Task
- Easy Task
- 矩阵——vijos1194 Domino
- ubuntu下postgreSQL9.6安装配置
- 关于UEFI启动+GPT分区 的一些经验
- 虚继承
- 商品展示
- Easy-16
- 分治算法——棋盘覆盖
- Maven依赖范围
- Trie树的建立—查找字典中以特定字符串开头的单词数量(java实现)
- 第二天-2017-05-03
- struts2框架学习第一天
- Android框架之路——Banner实现轮播图(RecyclerView添加Header)
- enum注意事项
- HDU 5974 A Simple Math Problem(数论)