leetcode[Longest Uncommon Subsequence I ]//待整理多种解法
来源:互联网 发布:mac numbers 公式 编辑:程序博客网 时间:2024/05/21 19:21
解法一:
public class Solution {//问题描述,找出字符串a和字符串b的最长子串的长度,这个子串需要满足的条件:当它来自于一个字符串时,它不能是另一个字符串的子串 public int findLUSlength(String a, String b) { //只能从字符串a和b本身出发,因为当a被b包括,那么a的子串也一定是被b包括了 int res = -1; int lengthA = a.length(); int lengthB = b.length(); if(lengthA == lengthB){//长度相同就看彼此是否相同,相同说明彼此互相不含 if(a.equals(b)){ return -1; } else{ return lengthA; } } else{//长度不同就返回长度较大那个,长度大的那个一定不会被包含 return Math.max(lengthA, lengthB); } }}
阅读全文
0 0
- leetcode[Longest Uncommon Subsequence I ]//待整理多种解法
- Longest Uncommon Subsequence I(leetcode)
- leetcode[Longest Palindrome]//待整理多种解法
- 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
- 我们有必要花时间了解spring boot吗?
- nginx(3):nginx常用命令(启动,重启,停止)
- maven工程的创建(三)
- Site matching query does not exist.
- ios 文件存储
- leetcode[Longest Uncommon Subsequence I ]//待整理多种解法
- PAT 1002 写出这个数
- What the Fuck?年薪30万的码农不如公务员
- Java深拷贝与浅拷贝
- freemarker基本语法
- mybatis自己容易忘记的东西2(仅适自己)
- 网络分析工具
- Tomcat+Nginx负载均衡群集搭建
- 图形学数学--矩阵