string longestCommonPrefix(vector<string>& strs) {
if (strs.empty())return "";
string ans = strs[0];
for (vector<string>::iterator it = strs.begin()+1; it != strs.end(); ++it) {
if (it->empty())return "";
for (int i = 0; i<ans.size()>(*it).size() ? (*it).size() : ans.size(); ++i) {
if (ans[i] != (*it)[i]) {
ans = ans.substr(0, i);
if (ans.empty())return ans;
break;
}
}
}
return ans;
}
14. Longest Common Prefix
最新推荐文章于 2022-03-20 08:23:53 发布