优选算法_字符串_最长公共前缀_C++

一.题目解析两字符串寻找最长的公共前缀算法解析:模拟一两两比较,判断是否相等,相等指针继续向后,不相等就返回比较就简单了,两指针遍历判断是否相等即可代码编写:class Solution { public: string longestCommonPrefix(vectorstring strs) { if(strs.empty())return ; string retstrs[0]; for(int i0;istrs.size();i) { retfindcommon(ret,strs[i]); } return ret; } string findcommon(string s1,string s2) { int i0; while(imin(s1.size(),s2.size())s1[i]s2[i])i; return s1.substr(0,i); } };算法解析:模拟二代码编写:class Solution { public: string longestCommonPrefix(vectorstring strs) { for(int i0;istrs[0].size();i) { char s1strs[0][i]; for(int j1;jstrs.size();j) { if(istrs[j].size()||s1!strs[j][i]) return strs[0].substr(0,i) ; } } return strs[0]; } };