Longest Uncommon Subsequence I(leetcode)

来源:互联网 发布:js实现鼠标特效 编辑:程序博客网 时间:2024/06/05 17:57

Longest Uncommon Subsequence I

  • Longest Uncommon Subsequence I
    • 题目
    • 解决


题目

leetcode题目

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: 3Explanation: 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. 比较两个字符串的长度,则返回较长字符串的长度
  2. 若两个字符串相同(一模一样),则返回-1。
class Solution {public:    int findLUSlength(string a, string b) {        int result;        if (a.size() > b.size()) {            result = a.size();        } else {            result = b.size();        }        if (a == b) {            return -1;        } else {            return result;        }    }};