zoukankan      html  css  js  c++  java
  • LeetCode 521. Longest Uncommon Subsequence I

    question:

     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.

    try:

    class Solution {
        public int findLUSlength(String a, String b) {
            if(a.equals(b)){
                return -1;
            }else{
                return a.length()<b.length()? b.length():a.length();
            }
        }
    }

    result:

    conclusion:

     对这个题无语。

    一开始我在想暴力法,先找到所有substring,再找最长的那个。但是好复杂。

    看了讨论区,一个人说这是愚人节的题目。。才找到思路。。

  • 相关阅读:
    Spark Streaming自定义接收器
    between-flink-and-storm-Spark
    Java class loader 类加载器
    Spark 学习文章
    英文读音
    分布式系统论文
    git 常用命令
    CPU Cache
    elasticsearch 索引延迟 一致性问题等
    spark join
  • 原文地址:https://www.cnblogs.com/hzg1981/p/8970901.html
Copyright © 2011-2022 走看看