[recommend] clear logic and concice implementation can help you

  • 0
    class Solution {
        string longestCommonPrefix(vector<string>& strs) {
            string prefix="";
            if(strs.size()==0)  return prefix;
            /** check char by char, for each char, check all the string word **/
            for(int k=0; k<strs[0].size(); k++){
                int i=1;
                for(; i<strs.size() && strs[i].size()>k; i++){
                        return prefix;
                if(i==strs.size()) prefix+=strs[0][k];
            return prefix;

Log in to reply

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