Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
int n=strs.size();
if(n==0)return "";
string str;
for(int j=0;;j++){
if(j>=strs[0].size())break;
char t=strs[0][j];
bool flag=true;
for(int i=1;i<n;i++){
if(j>=strs[i].size()||strs[i][j]!=t){
flag=false;
break;
}
}
if(flag){
str+=t;
}
else break;
}
return str;
}
};