Easy to understand 6 lines c++ code


  • 0
    string longestCommonPrefix(vector<string>& strs) {
        if(strs.size() == 0) return "";
        int i = -1;
        while(strs[0][++i])
            for(int j = 0;j < strs.size();j++)
                if(strs[j][i] != strs[0][i]) return strs[0].substr(0,i);
        return strs[0].substr(0,i);
    }

Log in to reply
 

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