class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.size()==0){
return "";
}
string ans;
int i=0;
int j;
while(i<strs[0].size()){
j=1;
while(j<strs.size()){
if(i>=strs[j].size()||strs[j][i]!=strs[0][i]){
return ans;
}
j++;
}
ans.push_back(strs[0][i]);
i++;
}
return ans;
}
};
网友评论