LeetCode -Longest Common Prefix

代码最简洁的：

string longestCommonPrefix(vector<string>& strs) 
{
	if(strs.size()==0)  return "";
	for(int i=0;i<strs[0].size();i++)//每一字符串位置下标
                for(int j=1;j<strs.size();j++)//第几个字符串
			if((i>=strs[j].size())||(strs[j][i]!=strs[0][i]))  return strs[0].substr(0,i);
	return strs[0];
}

递归二分法：

string longestCommonPrefix(vector<string>& strs) 
{
    int size = strs.size();
    if (size==0)
        return "";
    if (size == 1)
        return strs[0];
    vector<string> v1(strs.begin(), strs.begin()+size/2);
    vector<string> v2(strs.begin()+size/2, strs.end());
    string s1 = longestCommonPrefix(v1);
    string s2 = longestCommonPrefix(v2);
    return longestCommon(s1, s2);
}

string longestCommon(string& s1, string& s2) {
    int i = 0;
    while (i<min(s1.size(), s2.size()) && s1[i] == s2[i])
        i++;
    return s1.substr(0, i);
}