题目描述
思路分析
模拟
代码实现
class Solution {
public:
int min(int a,int b){
if(a>=b)return b;
else return a;
}
string longestCommonPrefix(vector<string>& strs) {
int minlen=300;
for(int i=0;i<strs.size();i++) minlen=min(minlen,strs[i].size());
string res="";
bool flag=true;
for(int i=0;i<minlen;i++){
for(int j=1;j<strs.size();j++){
if(strs[j][i]!=strs[j-1][i]){
flag=false;
break;
}
}
if(flag==false)break;
else res=res+strs[0][i];
}
return res;
}
};