#include<string>
#include<vector>
using namespace std;
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string result="";
if(strs.size()==0){
return result;
}
int min=strs[0].size();//找最小长度
for(int i=0;i<strs.size();i++){
if(min>strs[i].size()){
min=strs[i].size();
}
}
for(int i=0;i<min;i++){
int flag=0;
for(int j=0;j<strs.size()-1;j++){
if(strs[j][i]!=strs[j+1][i]){
flag=1;
break;
}
}
if(flag==1){break;}
result.push_back(strs[0][i]);
}
return result;
}
};