14.最长公共前缀

🥛  

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        string prefix;
        if(!strs.size())
            return prefix;
        int msz = 1000;
        for(auto v : strs) {
            if(v.size() < msz)
                msz = v.size();
        }
        for(int i = 0; i < msz; ++i) {
            char c = strs[0][i];
            for(auto s: strs) {
                if(s[i] != c) 
                    return prefix;
            }
            prefix += c;
        }
        return prefix;
    }
};

Accepted

118/118 cases passed (28 ms)

Your runtime beats 7.46 % of cpp submissions

Your memory usage beats 5.02 % of cpp submissions (15.3 MB)