leetcode14 最长公共前缀

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if(strs.empty())
            return "";
        else{
        int len=strs.size();
        if(len==1)
            return strs[0];
        int minn=strs[0].size();
        for(int i=1;i<len;i++)
        {
            for(int j=0;j<minn;j++)
                if(strs[i][j]!=strs[0][j]){
                    minn=j;break;}
            if(minn==0)
                break;
        }
        return (minn==0)?"":strs[0].substr(0,minn);
        }
    }
};