算法作业_15(2017.4.15第八周)
来源:互联网 发布:华为软件官网 编辑:程序博客网 时间:2024/06/05 07:31
521. Longest Uncommon Subsequence I
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.
题目大意:
给定两个字符串,计算其“最长不公共子序列”。最长不公共子序列是指:两字符串中某一个的子序列,该子序列不是另一个字符串的子序列,并且长度最长。
子序列是指从一个序列中删除一些字符,剩余字符顺序保持不变得到的新序列。任何字符串都是其本身的子序列,空串不属于任意字符串的子序列。
返回最长不公共子序列,若不存在,返回-1。
解题思路:
若两字符串不相等,选择较长的字符串返回长度即可。
否则返回-1。(若两字符串相等,则任意字符串的子串均为另一个的子串)
class Solution {public: int findLUSlength(string a, string b) { if(a==b){ return -1; } else{ return a.size()>b.size()?a.size():b.size(); } }};
- 算法作业_15(2017.4.15第八周)
- 算法作业_14(2017.4.12第八周)
- 算法第八周作业01
- 算法课第八周作业 | Unique Paths
- 算法第八次作业
- 算法_15:数值算法
- 算法结构与设计基础作业第八周
- 算法分析与设计课程作业第八周#1
- 第八周--作业要求
- 第八周作业
- 第八周作业
- 第八周作业1
- 第八周作业 1.1
- 第八周作业 1.3
- 第八周作业 2.0
- 第八周作业 3.0
- 第八周作业-1
- 第八周C++作业
- android 中Timer类源码分析
- poj 2799 IP Networks
- bower 入门
- java使用redis
- firewall常用操作
- 算法作业_15(2017.4.15第八周)
- HFSS天线设计
- LeetCode:Odd Even Linked List
- Spring Cloud——断路器监控Hystrix Dashboard&Turbine
- ubuntu改变区域后对Postgresql的影响
- matlab常用快捷键
- pat 1120. Friend Numbers
- OpenCV实现基本灰度变换
- the diary for redirection in linux