class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string s;
if(strs.empty())return s;
for(int i=0;i<strs[0].size();i++)
{
char result=strs[0][i];
for(int j=1;j<strs.size();j++)
{
if(i>=strs[j].size()||result!=strs[j][i])
{
return s;
}
}
s+=(result);
cout<<s<<" "<<result<<endl;
}
return s;
}
};