Leetcode 12

//日积月累，水滴石穿
class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.empty()) return "";   //必须要加空的特判
        string res = "";
        for(int i=0;i < strs[0].size();i++){
            for(int j=0;j < strs.size();j++){
                if(i >= strs[j].size() || strs[j][i] != strs[0][i])
                    return res;
            }
            res.push_back(strs[0][i]);
        }
        return res;
    }
};
int main()
{
    string s[3] = {"abca","abc"};  //内容为string的vector
    vector<string> n;
    n.insert(n.begin(),s,s+2);

    Solution a;
    cout << a.longestCommonPrefix(n) << endl;

    return 0;
}

_