class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.size()==0)
{
string empty;
return empty;
}
string subs(strs[0]);
for(int i=1;i<strs.size();i++)
{
int minl=min(subs.length(),strs[i].length());
int j;
for( j=0;j<minl;j++)
{
if(strs[i][j]!=subs[j])
break;
}
subs=subs.substr(0,j);
}
return subs;
}
};
14. Longest Common Prefix
最新推荐文章于 2020-02-12 22:28:51 发布