原题链接
代码如下:
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.empty()) return "";
string res;
for(int i = 0; ; i ++){
if(i >= strs[0].size()) return res;
char c = strs[0][i];
for(auto& str : strs)
if(i > str.size() || str[i] != c) return res;
res += c;
}
return res;
}
};