Write a function to find the longest common prefix string amongst an array of strings.
判断将第一个string赋值到一个model中,然后model与下一个string进行比较,找到longest common prefix,然后将比较结果重新赋值到model中在与下一个string变量进行比较,以此类推,找到所有longest common prefix;
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.size() == 0)
return "";
string model = strs[0];
for(int i = 1; i < strs.size(); i++){
int len1 = model.size();
int len2 = model.size();
if(len1 < len2)
len1 = len2;
int j = 0;
for(; j < len1; j++){
if(model[j] != strs[i][j])
break;
}
model = model.substr(0,j);
}
return model;
}
};