Concise c++ solution


  • 0
    K
    class Solution {
    public:
        string longestCommonPrefix(vector<string>& strs) {
            if (strs.empty()) return "";
            for (int i = 0; i < strs[0].size(); ++i)
                for (int j = 0; j < strs.size(); ++j)
                    if (strs[j].size() < i + 1 || strs[j][i] != strs[0][i])
                        return strs[0].substr(0, i);
            return strs[0];
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.