522. Longest Uncommon Subsequence II
来源:互联网 发布:免费男女交友软件 编辑:程序博客网 时间:2024/05/16 18:45
Given a list of strings, you need to find the longest uncommon subsequence among them. 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 a list of 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", "eae"Output: 3
Note:
- All the given strings' lengths will not exceed 10.
- The length of the given list will be in the range of [2, 50].
1、按照字符串长度降序排列strs
2、遍历strs,如果str不是所有strs的独有子字符串,返回str的长度
3、如果没有找到独有字符串,返回-1
按照解题思路写代码,代码如下:
public class Solution { public int findLUSlength(String[] strs) { Arrays.sort(strs, new Comparator<String>() { public int compare(String s1, String s2) { return s2.length() - s1.length(); } }); for (int i = 0; i < strs.length; i ++) { int noMatches = strs.length - 1; for (int j = 0; j < strs.length; j ++) { if (i != j && isSubString(strs[i], strs[j])) { noMatches --; } if (noMatches == 0) { return strs[i].length(); } } } return -1; } private boolean isSubString(String s1, String s2) { int i = 0; for (char ch: s2.toCharArray()) { if (i < s1.length() && s1.charAt(i) == ch) { i ++; } } if (i == s1.length()) { return false; } return true; }}
- 522. Longest Uncommon Subsequence II
- 522. Longest Uncommon Subsequence II
- 522. Longest Uncommon Subsequence II
- [leetcode]522. Longest Uncommon Subsequence II
- leetcode 522. Longest Uncommon Subsequence II
- [LeetCode]522. Longest Uncommon Subsequence II
- 522. Longest Uncommon Subsequence II 题解
- [Leetcode]522. Longest Uncommon Subsequence II
- [Leetcode] 522. Longest Uncommon Subsequence II 解题报告
- Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I
- leetcode 522. Longest Uncommon Subsequence II 最长非公共子序列
- 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
- OpenCV学习笔记(一)——光流法学习
- windows下xampp集成环境安装配置方法 、部署bugfree及部署禅道
- 欢迎使用CSDN-markdown编辑器
- 【python学习笔记】7:用python实现爬虫-基础
- LeetCode 14. Longest Common Prefix(字符串)
- 522. Longest Uncommon Subsequence II
- ARM的常数表达式
- tensorflow 图像分类实战解析
- 多线程学习笔记3-线程间的通信(1)
- JavaScript "黑科技知识点"总结
- LeetCode 9. Palindrome Number
- Leetcode学习(8)—— Keyboard Row
- python 高级函数 —— filter()
- Mongodb 入门