第十九天
KMP算法看不懂,明天多看几遍,争取弄懂
最长公共前缀
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(!strs.size()){
return "";
}
int len = strs[0].size();
int count = strs.size();
for(int i = 0;i < len; i++){
char c = strs[0][i];
for(int j = 0;j < count;j++){
if(i == strs[j].size()||strs[j][i]!=c){
return strs[0].substr(0,i);
}
}
}
return strs[0];
}
};