刷 LeetCode 从零开始学 GoLang（5）：14. Longest Common Prefix

题目描述

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.

GoLang 语法：string

1. GoLang 的 ​​string​​ 是不更改的字符串
2. ​​string​​ 是按照 UTF-8 编码的

AC 代码

func longestCommonPrefix(strs []string) string {
    // A string is an IMMUTABLE sequence of bytes.
    var ans string
    
    // len function returns the number of bytes (not runes) in string.
    for i := 0; len(strs) != 0 && i < len(strs[0]); i++{
        flag := true
        for j := 1; j < len(strs); j++{
            if i >= len(strs[j]) || strs[j][i] != strs[0][i] {
                flag = false
            }
        }
        
        if flag {
            // [beg:end]: 左闭右开区间 [beg, end)
            ans = strs[0][:(i+1)]
        } else {
            break
        }
    }
    
    return ans
}