3ms c++ solution


  • 0
    X
    string longestCommonPrefix(vector<string>& strs) {
        if(strs.size()==0)
           return string("");
        if(strs.size()==1)
          return strs[0];
        for(int i=0;i<strs[0].size();++i){
            for(int j=1;j<strs.size();++j){
                if((i>=strs[j].size())||(strs[j][i]!=strs[0][i])){
                     return string(strs[0],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.