☆打卡算法☆LeetCode 14、最长公共前缀 算法解析

示例 1：
输入：strs = ["flower","flow","flight"]
输出：fl

示例 2：
输入：strs = ["dog","cat","rabbit"]
输出：""
解析: 输入不存在公共前缀

public class Solution 
{
    public string LongestCommonPrefix(string[] strs) 
    {
        if (strs == null || strs.Length == 0)
        {
            return "";
        }
        int length = strs[0].Length;
        int count = strs.Length;
        for (int i = 0; i < length; i++)
        {
            char c = strs[0][i];
            for (int j = 0; j < count; j++)
            {
                if (i == strs[j].Length || strs[j][i] != c)
                {
                    return strs[0].Substring(0, i);
                }
            }
        }
        return strs[0];
    }
}