【LeetCode】14. Longest Common Prefix

题目：

代码：

class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.empty()) return "";
int prefix_len = strs[0].size();
for (int i = 1; i < strs.size() ;++i){
int j = 0;
for (; j < prefix_len && strs[i][j] == strs[0][j]; ++j);
prefix_len = j;
}
return strs[0].substr(0, prefix_len);
}
};