Write a function to find the longest common prefix string amongst an array of strings.
这题应该没什么难度,顶多就考虑一下如果strings头是空格算不算公用前缀,这个我也不知道,系统判定后才知道应该是算的。
class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
if(strs.size() == 0)
return "";
int minlength = strs[0].length();
for (int i = 1; i < strs.size(); i++){
if(minlength > strs[i].length())
minlength = strs[i].length();
}
string commonPrefix = "";
for (int i = 0; i < minlength; i++){
char c = strs[0][i];
for (int j = 0; j < strs.size(); j++){
if ( c!= strs[j][i]){
return commonPrefix;
}
}
commonPrefix.push_back(c);
}
return commonPrefix;
}
};