[Swift]LeetCode522. 最长特殊序列 II | Longest Uncommon Subsequence II

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10397495.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given a list of strings, you need to find the longest uncommon subsequence among them. 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 a list of 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", "eae"
Output: 3 

Note:

1. All the given strings' lengths will not exceed 10.
2. The length of the given list will be in the range of [2, 50].

---

给定字符串列表，你需要从它们中找出最长的特殊序列。最长特殊序列定义如下：该序列为某字符串独有的最长子序列（即不能是其他字符串的子序列）。

子序列可以通过删去字符串中的某些字符实现，但不能改变剩余字符的相对顺序。空序列为所有字符串的子序列，任何字符串为其自身的子序列。

输入将是一个字符串列表，输出是最长特殊序列的长度。如果最长特殊序列不存在，返回 -1 。 

示例：

输入: "aba", "cdc", "eae"
输出: 3 

提示：

1. 所有给定的字符串长度不会超过 10 。
2. 给定字符串列表的长度将在 [2, 50 ] 之间。

---

Runtime: 16 ms

Memory Usage: 19.8 MB

class Solution {
    func findLUSlength(_ strs: [String]) -> Int {
        var strs = strs
        var n:Int = strs.count
        var s:Set<String> = Set<String>()
        strs.sort(by:{
            if $0.count == $1.count
            {
                return $0 > $1
            }
             return $0.count > $1.count
        })
        for i in 0..<n
        {
            if i == n - 1 || strs[i] != strs[i + 1]
            {
                var found:Bool = true
                for a in s
                {
                    var j:Int = 0
                    for c in a.characters
                    {
                        if c == strs[i][j] {j += 1}
                        if j == strs[i].count {break}
                    }
                    if j == strs[i].count
                    {
                        found = false
                        break
                    }
                }
                if found {return strs[i].count}                
            }
            s.insert(strs[i])
        }
        return -1
    }
}

extension String {        
    //subscript函数可以检索数组中的值
    //直接按照索引方式截取指定索引的字符
    subscript (_ i: Int) -> Character {
        //读取字符
        get {return self[index(startIndex, offsetBy: i)]}
    }
}

---

16ms

class Solution {
    func findLUSlength(_ strs: [String]) -> Int {
        var sortStrs = strs.sorted { 
            return $1.count < $0.count || ($1.count == $0.count && $1 < $0 )
        }
        let duplicates = getDuplicates(sortStrs)
        for i in sortStrs.indices {
            if !duplicates.contains(sortStrs[i]) {
                if i == 0 { return sortStrs[i].count }
                for j in 0..<i {
                    if isSubsequence(Array(sortStrs[j]), Array(sortStrs[i])) {
                        break
                    }
                    if j == i-1 {
                        return sortStrs[i].count
                    }
                }
            }
        }
        return -1
    }

    func isSubsequence(_ chars1: [Character], _ chars2: [Character]) -> Bool {
        var i = 0, j = 0
        while i<chars1.count && j<chars2.count {
            if chars1[i] == chars2[j] {
                j += 1
            }
            i += 1
        }
        return j == chars2.count
    }

    func getDuplicates(_ strs: [String]) -> Set<String> {
        var set = Set<String>()
        var duplicates = Set<String>()
        for s in strs {
            if set.contains(s) {
                duplicates.insert(s)
            }else {
                set.insert(s)
            }
        }
        return duplicates
    }
}