题目
C#代码
public class Solution {
public string LongestCommonPrefix(string[] strs) {
if (strs.Length == 0)
{
return "";
}
string result = "";
for (int i = 0; i < strs[0].Length; i++)
{
for (int j = 1; j < strs.Length; j++)
{
if (i >= strs[j].Length || !strs[0][i].Equals(strs[j][i]))
{
return result;
}
}
result = strs[0].Substring(0, i+1);
}
return result;
}
}