100题打下卡
string longestCommonPrefix(vector<string>& strs) {
if(strs.size()==0)
return "";
string s = strs[0];
for(int i = 1;i < strs.size();i++)
{
int j = 0, k = 0;
string temp;
while(j < s.size() && k < strs[i].size())
{
if(s[j] == strs[i][k])
{
temp.push_back(s[j++]);
k++;
}
else
break;
}
if(temp.size() == 0)
return "";
s = temp;
}
return s;
}