leetcode14

public class Solution {
    public string LongestCommonPrefix(string[] strs) {
        if (strs.Length == 0)
            {
                return "";
            }
            else if (strs.Length == 1)
            {
                return strs[0];
            }
            else
            {
                var maxLen = 1;

                var len = strs.Length;
                while (true)
                {
                    for (int i = 0; i < len - 1; i++)
                    {
                        var s1 = strs[i];
                        var s2 = strs[i + 1];

                        if (s1.Length < maxLen || s2.Length < maxLen)
                        {
                            return strs[0].Substring(0, maxLen - 1);
                        }

                        if (s1.Substring(0, maxLen) != s2.Substring(0, maxLen))
                        {
                            return strs[0].Substring(0, maxLen - 1);
                        }
                    }
                    maxLen++;
                }
            }
    }
}

https://leetcode.com/problems/longest-common-prefix/#/description

补充一个python的实现：

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        n = len(strs)
        if n == 0:
            return ''
        if n == 1:
            return strs[0]
        j = 0
        while True:
            for i in range(1,n):
                if j >= len(strs[i-1]) or j >= len(strs[i]):
                    return strs[i][:j]
                if strs[i-1][j] != strs[i][j]:
                    return strs[i][:j]
            j += 1
        return strs[0][:j]