Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

Subscribe to see which companies asked this question

class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string s1;
if(strs.size()==0) return s1;
s1=strs[0];
for(int j=1;j<strs.size();++j)
{
int i=0;
for(;i<s1.size();++i)
{
if(s1[i]!=strs[j][i])
break;
}
// s1=string(s1.begin(),s1.begin()+i);
s1=s1.substr(0,i);
}
return s1;

}
};