class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string str,temp;
string t1="";
int length;
if(strs.size() == 0)
return "";
else{
temp = strs[0];
for(int i=1;i<strs.size();i++){
str = strs[i];
t1 = "";
if(temp.length()<str.length())
length = temp.length();
else
length = str.length();
for(int j=0;j<length;j++){
if(temp[j] == str[j]){
t1 = t1 + temp[j];
continue;
}
else
break;
}
temp = t1;
}
return temp;
}
}
};