力扣14.最长公共前缀
-
每次找两个字符串的最长公共前缀
-
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 len = min(str1.size(),str2.size()); int idx = 0; while(idx < len && str1[idx] == str2[idx]) idx ++; return str1.substr(0,idx); } };