Longest Common Prefix

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

1. 本题题意描述不太清楚
2. 找出所有字符串的公共最大前缀，就有一组字符串，它们都有共同的前缀。

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        int n = strs.size();
        if(n == 0)return "";
        int len = strs[0].size();//最长前缀的长度
        for(int i = 1; i < n; i++)
        {
            int k;
            for(k = 0; k < min(len, (int)strs[i].size()); k++)
                if(strs[0][k] != strs[i][k])break;
            if(len > k)len = k;
        }
        return strs[0].substr(0, len);
    }
};