[Swift]LeetCode14. 最长公共前缀 | Longest Common Prefix

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

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

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

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

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

---

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀，返回空字符串 ""。

示例 1:

输入: ["flower","flow","flight"]
输出: "fl"

示例 2:

输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。

说明:

所有输入只包含小写字母 a-z 。

---

16ms

class Solution {
    func longestCommonPrefix(_ strs: [String]) -> String {
        let minStr = try? strs.min(by: { $0.count < $1.count })
        guard var minS = minStr! else {
            return ""
        }
        
        var endIndex = minS.endIndex
        for str in strs {
            if (str.hasPrefix(minS)) {
                continue
            }
            while endIndex > minS.startIndex && !str.hasPrefix(minS) {
                endIndex = minS.index(before: endIndex)
                minS = String(minS[minS.startIndex..<endIndex])
            }
        }
        return minS
    }
}

---

20ms

class Solution {
       func longestCommonPrefix(_ strs: [String]) -> String {
        
        if strs.count == 0 {
            return ""
        }
        var prefix = strs[0]
        for i in 0..<strs.count {
            while strs[i].hasPrefix(prefix) == false {
                prefix = prefix.substring(to: prefix.index(before: prefix.endIndex))
                if prefix.isEmpty {
                    return ""
                }
            }
        }
        return prefix
    }
}

---

24ms

class Solution {
    func longestCommonPrefix(_ strs: [String]) -> String {
        guard strs.count > 0 else { return "" }
        var shortestPrefix = strs.min{ $0.count < $1.count }!
        print(shortestPrefix)
        for s in strs {
            while shortestPrefix.count > 0 , !s.hasPrefix(shortestPrefix) {
                shortestPrefix.removeLast()
            }
        }
        return shortestPrefix
    }
}

---

28ms

class Solution {
    func longestCommonPrefix(_ strs: [String]) -> String {

        var res = ""
        if strs.isEmpty {
            
            return res
        }
        
        res = strs[0]
        
        for i in 1..<strs.count {
            
            var find = Array(strs[i])
            var current = Array(res)
            res = ""
            for i in 0..<find.count {
                
                if i >= current.count {
                    break
                }
                
                if current[i] != find[i] {
                    
                    break
                } else {
                    
                    res += String(current[i])
                }
            }
            
        }
        
        return res
    }
}

---

32ms

class Solution {
  func longestCommonPrefix(_ strs: [String]) -> String {
    guard let first = strs.first else { return "" }

    var currentPrefix = ""
    var bestPrefix = ""

    for letter in first { 
      currentPrefix.append(letter)

      for word in strs {
        if !word.hasPrefix(currentPrefix) { 
          return bestPrefix 
        }
      }

      bestPrefix = currentPrefix
    }

    return bestPrefix                
  }
}