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: strs = ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Constraints:
1 <= strs.length <= 2000 <= strs[i].length <= 200strs[i]consists of only lowercase English letters.
Solution:
public class Solution {
public string LongestCommonPrefix(string[] strs) {
string min=strs[0];
foreach(string word in strs)
{
StringBuilder res= new StringBuilder();
if(min.Length>word.Length){
int i=0;
foreach(char each in word)
{
if(each==min[i++])
{
res.Append(each);
}
else break;
}
}
else{
int i=0;
foreach(char each in min)
{
if(each==word[i++])
{
res.Append(each);
}
else break;
}
}
min=res.ToString();
}
return min;
}
}
