class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (!strs.size()) {
return "";
}
string prefix = strs[0];
int count = strs.size();
for (int i = 1; i < count; ++i) {
prefix = longestCommonPrefix(prefix, strs[i]);
if (!prefix.size()) {
break;
}
}
return prefix;
}
string longestCommonPrefix(const string& str1, const string& str2) {
int length = min(str1.size(), str2.size());
int index = 0;
while (index < length && str1[index] == str2[index]) {
++index;
}
return str1.substr(0, index);
}
};
10-26
617
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-05
633
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
04-11
1109
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-25
174
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
05-31
123
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)