LeetCode 14. Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        string result = "";
        if (!strs.size())return result;
        result = strs[0];
        for (auto &e : strs)
        {
            if (e.size() < result.size())
                result = e;
        }
        for (auto &e : strs)
        {
            int i = 0;
            for (;i < result.size();++i)
            {
                if (e[i] != result[i])break;
            }
            result=result.substr(0, i);
        }
        return result;
    }
};