zoukankan      html  css  js  c++  java
  • 521. Longest Uncommon Subsequence I【easy】

    521. Longest Uncommon Subsequence I【easy】

    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:

    1. Both strings' lengths will not exceed 100.
    2. Only letters from a ~ z will appear in input strings.

    解法一:

     1 class Solution {
     2 public:
     3     int findLUSlength(string a, string b) {
     4         if (a.size() != b.size()) {
     5             return max(a.size(), b.size());
     6         }
     7         else {
     8             return (a == b ? -1 : a.size());
     9         }
    10     }
    11 };
  • 相关阅读:
    第三章 SpringCloud之Eureka-Client服务提供者
    第二章 SpringCloud之Eureka-Server服务发现组件
    第一章 SpringCloud简介
    Storm之WordCount初探
    Solr之java实现增删查操作
    Solr安装并导入mysql数据
    java之消息队列ActiveMQ实践
    Ant Design使用方法
    Reactjs之实现js跳转路由
    React之js实现跳转路由
  • 原文地址:https://www.cnblogs.com/abc-begin/p/7581878.html
Copyright © 2011-2022 走看看