C# Soulution 1
由自带Solution中java写法做微小改动。纯做记录。
public class Solution {
public string LongestCommonPrefix(string[] strs) {
if(strs.Length==0) return "";
string prefix=strs[0];
for(int i=1;i<strs.Length;i++)
{
while(strs[i].IndexOf(prefix)!=0)
{
prefix=prefix.Substring(0,prefix.Length-1);
if(prefix.Length==0) return "";
}
}
return prefix;
}
}
C# solution 2
由自带Solution中java写法做微小改动。纯做记录。
public class Solution {
public string LongestCommonPrefix(string[] strs) {
if (strs == null || strs.Length == 0) return "";
for (int i = 0; i < strs[0].Length; i++)
{
string c = strs[0].Substring(i,1);
for (int j = 1; j < strs.Length; j++)
{
if (i == strs[j].Length || strs[j].Substring(i,1) != c)
return strs[0].Substring(0, i);
}
}
return strs[0];
}
}