swift語言，[Swift]LeetCode288. 唯一單詞縮寫 $ Unique Word Abbreviation

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
?微信公眾號：山青詠芝（shanqingyongzhi）
?博客園地址：山青詠芝（https://www.cnblogs.com/strengthen/）
?GitHub地址：https://github.com/strengthen/LeetCode
?原文地址：https://www.cnblogs.com/strengthen/p/10688932.html?
?如果鏈接不是山青詠芝的博客園地址，則可能是爬取作者的文章。
?原文已修改更新！強烈建議點擊原文地址閱讀！支持作者！支持原創！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

An abbreviation of a word follows the form <first letter><number><last letter>. Below are some examples of word abbreviations:

a) it                      --> it    (no abbreviation)1
b) d|o|g                   --> d1g1    1  11---5----0----5--8
c) i|nternationalizatio|n  --> i18n11---5----0
d) l|ocalizatio|n          --> l10n

swift語言？Assume you have a dictionary and given a word, find whether its abbreviation is unique in the dictionary. A word's abbreviation is unique if no?other?word from the dictionary has the same abbreviation.

Example:?

Given dictionary = [ "deer", "door", "cake", "card" ]isUnique("dear") -> false
isUnique("cart") -> true
isUnique("cane") -> false
isUnique("make") -> true

---

單詞的縮寫詞遵循形式<first letter><number><last letter>。以下是單詞縮寫的一些示例：

a) it                      --> it    (無縮寫)1
b) d|o|g                   --> d1g1    1  11---5----0----5--8
c) i|nternationalizatio|n  --> i18n11---5----0
d) l|ocalizatio|n          --> l10n

縮寫？假設你有一本字典并給了一個單詞，找出它的縮寫在字典中是否唯一。如果字典中沒有其他單詞具有相同的縮寫，則單詞的縮寫是唯一的。

例子：

給定 dictionary = [ "deer", "door", "cake", "card" ]isUnique("dear") -> false
isUnique("cart") -> true
isUnique("cane") -> false
isUnique("make") -> true

---

Solution:

class Solution {
    var m:[String:Set<String>] = [String:Set<String>]()
    func ValidWordAbbr(_ dictionary:inout [String]) {
        for a in dictionary
        {
            let arr:[Character] = Array(a)
            let k:String = String(arr[0]) + String(a.count - 2) + String(arr.last!)
            m[k,default:Set<String>()].insert(a)
        }
    }
    
    func isUnique(_ word:String) -> Bool
    {
        let arr:[Character] = Array(word)
        let k:String = String(arr[0]) + String(word.count - 2) + String(arr.last!)
        let num:Int = m[k,default:Set<String>()].contains(word) ? 1 : 0
        return num == m[k,default:Set<String>()].count
    }
}

---

點擊：Playground測試

var sol = Solution()
var arr:[String] = [ "deer", "door", "cake", "card" ]
sol.ValidWordAbbr(&arr)
print(sol.isUnique("dear"))
//Print false
print(sol.isUnique("cart"))
//Print true
print(sol.isUnique("cane"))
//Print false
print(sol.isUnique("make"))
//Print true

單詞，?