14、Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

Hide Tags

 String

string longestCommonPrefix(vector<string> &strs) {        //此题比较简单基本上就是比较字符串的前缀        int len = strs.size();        if (len == 0)            return "";        string s = strs[0];        for (int i = 1; i < len; ++i)        {            int length = min(strs[i].size(), s.size());            if (length == 0) return "";            int k = 0;            while (k < length && strs[i][k] == s[k])                ++k;            s = s.substr(0, k);        }        return s;    }