6-line c++ lightening fast


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

  • 1
    P

    the if statement can rewrite as " if( strs[0][i] != strs[j][i])" . Because s[s.size()] == '\0' can be a guard.


Log in to reply
 

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