1.C++
bool static cmp(const string &a, const string &b) {
return a.length() < b.length();
}
string longestCommonPrefix(vector<string>& strs) {
sort(strs.begin(), strs.end(), cmp);
if(strs.size()==0)
return "";
string strRes = strs[0];
for (int i = 1; i < strs.size(); i++)
{
int index = -1;
for (int j = 0; j < strRes.size(); j++) {
if (strRes[j] != strs[i][j]) {
index = j;
break;
}
}
if (index != -1)
strRes = strRes.substr(0, index);
if (i == 1 && index == 0)
return "";
}
return strRes;
}