点击打开链接
//暴力
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.size()==0) return "";
// char* str = (char*) malloc(sizeof(char)*(strs[0].size()+1));
int len = strs[0].size();
char str[len+1];
for(int i=0; i<strs[0].size(); i++){
str[i] = strs[0][i];
}
str[strs[0].size()] = '\0';
for(int i=1; i<strs.size(); i++){
int j = 0;
while (str[j] && strs[i][j] && str[j]== strs[i][j]) {
j+=1;
}
str[j] = '\0'; //缩减
}
return string(str);
}
};