题目链接

思路

注意一下数组为0或数组为1的特殊情况就可以了

代码

class Solution {
    fun longestCommonPrefix(strs: Array<String>): String {
        if (strs.isEmpty()) return ""
        if (strs.size == 1) return strs[0]
        var len = 0
        var notEnd = true
        while (notEnd){
            for (i in 0 until strs.size - 1) {
                if (len > strs[i].length - 1 || len > strs[i+1].length - 1 || strs[i][len] != strs[i+1][len]) {
                    notEnd = false
                    break
                }
            }
            if (notEnd) len++
        }
        return strs[0].substring(0, len)
    }
}