题意:Write a function to find the longest common prefix string amongst an array of strings.
分析:找最长前缀
AC代码:
string longestCommonPrefix(vector<string>& strs){
string prefix;
int prefix_length = 0;
for(vector<string>::iterator it = strs.begin(); it != strs.end() && prefix_length >= 0;){
if(it == strs.begin()){
prefix = *it;
prefix_length = prefix.length();
++ it;
}else if((*it).substr(0, prefix_length) != prefix.substr(0, prefix_length)){
-- prefix_length;
}else{
++ it;
}
}
return prefix.substr(0, prefix_length);
}