Longest Common Prefix

题目描述:

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

  题目很唬人,搞清楚前缀的意思就简单了。解题思路就四个字:垂直匹配。

solution:

string longestCommonPrefix(vector<string> &strs) {
    int n = strs.size();
    if(n == 0)
        return "";
    if(n == 1)
        return strs[0];

    string res;
    for (int j = 0;j < strs[0].size();++j)
    {
        for (int i = 1;i < strs.size();++i)
        {
            if (j == strs[i].size() || strs[i][j] != strs[0][j])
                return res;
        }
        res += strs[0][j];
    }
    return res;
}

原文链接:https://oj.leetcode.com/discuss/15755/optimal-solution

ps:

  部分解法先去寻找最短的string, 再垂直匹配,我觉得没有必要。

转载于:https://www.cnblogs.com/gattaca/p/4279804.html

上一篇:LeetCode 14. Longest Common Prefix


下一篇:leetcode-easy-string-14 Longest Common Prefix