代码
class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
string result = "";
int n = strs.size();
if(n==0)
return result;
for(int i = 0; i < strs[0].size(); ++i)
{
for(int j = 1; j < n; ++j)
{
if(strs[j].size()==i || strs[0][i]!=strs[j][i])
return result;
}
result.push_back(strs[0][i]);
}
return result;
}
};