[leetcode] Longest Common Prefix

Longest Common Prefix

取第一个string,依次去掉不同的字符,剩下的就是LCP。

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        int len=strs.size();
        string res="";
        if(len<=0){
            return res;
        }
        
        res=strs[0];//first string
        for(int i=1;i<len;i++){
            int j=0;
            int ilen=min(res.size(),strs[i].size());
            if(ilen<=0){
                return "";
            }
            while(j<ilen){
                if(strs[i][j]==res[j]){
                    j++;
                }else{
                    break;
                }
            }
            res.erase(j,res.size());//erase res from position j
        }
        return res;
    }
};


你可能感兴趣的:([leetcode] Longest Common Prefix)