14. Longest Common Prefix

class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string result;
int len = strs.size();
if(len==0) return result;
int len1 = strs[0].size();
for(int i = 0; i < len1; i++)
{
int count = 0;
for(int j = 0; j < len; j++)
{
if(strs[0][i] == strs[j][i])
count ++;
if(strs[0][i] != strs[j][i])
return result;
}
if(count== len)
result += strs[0][i];
}
return result;
}
};