[LeetCode]Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        //我的思路是 公共前缀子串 每个字符串都有 先获得1 2的公共子串 然后在拿公共子串
        if(strs.size()==0){return "";}
        if(strs.size()==1){return strs[0];}
        string copy;
        copy=comoftwostr(strs[0],strs[1]);
        int i=2;
        while(i<strs.size()){
            copy=comoftwostr(copy,strs[i]);
            i++;
        }
        return copy;
    }
private:
    string comoftwostr(string s1,string s2){
        int l1=s1.length();
        int l2=s2.length();
        if(l1==0&&l2==0){return "";}
        int minlen = min(l1,l2);
        string ss;
        for(int i=0;i<minlen;i++){
            if(s1[i]==s2[i]) ss+=s1[i];
            else break;
        }
        return ss;
    }
};

11ms AC。