Description
Write a function to find the longest common prefix string amongst an array of strings.
找到一个字符串数组中的最长公共前缀,遍历每个字符串数组,比较两个相邻的字符串前缀是否相同,若相同则加入prefix中,若不相同则返回prefix,代码如下
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string prefix = "";
for (int i = 0; strs.size()>0; prefix += strs[0][i], i++) {
for (int j = 0; j < strs.size(); j++) {
if (i >= strs[j].size() || (j > 0 && strs[j][i] != strs[j-1][i])) return prefix;
}
}
return prefix;
}
};