【Leetcode】521. Longest Uncommon Subsequence I
来源:互联网 发布:矩阵的奇异值是什么 编辑:程序博客网 时间:2024/06/14 20:02
思路:
比较两个字符串的长度,若不相等,则返回长度的较大值,若相等则再判断两个字符串是否相同,若相同则返回-1,否则返回长度。
public class Solution { public int findLUSlength(String a, String b) { int lenA = a.length(); int lenB = b.length(); if (lenA != lenB) return Math.max(lenA, lenB); else if (!a.equals(b)) return lenA; else return -1; }}
Runtime:3ms
1 0
- 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
- [LeetCode]521. Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I(leetcode)
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- OutputStream、Read、Writer类的常用方法
- MATLAB UDP-广播 简单例子
- python读取pdf文档-文件
- 笔记1
- JDBC连接mysql数据库最基本的步骤简介
- 【Leetcode】521. Longest Uncommon Subsequence I
- javac与java
- Linux设置环境变量小结:设置永久变量&临时变量 全局变量&局部变量
- Explanation of some words(ENG -> CHN)
- Java基础复习(五)
- sizeof( )与strlen( )测数组的差异分析
- JAVA类加载器
- 每天一个Linux命令(10):cat
- gcc 分支预测