string longestCommonPrefix(vector<string> &strs) {
string commonPrefix;
if(strs.empty()) {
return commonPrefix;
}
int index = 0;
while(1) {
for(int i = 0; i < strs.size(); i++) {
string str = strs[i];
if(index >= str.length() || str[index] != strs[0][index]) {
return commonPrefix;
}
}
commonPrefix += strs[0][index];
index++;
}
}
[LeetCode] Longest Common Prefix
最新推荐文章于 2019-05-11 21:40:22 发布