Longest Common Prefix--LeetCode

最新推荐文章于 2021-01-20 10:50:36 发布

As_June

最新推荐文章于 2021-01-20 10:50:36 发布

阅读量228

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/As_June/article/details/78774382

版权

leetcode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Longest Common Prefix

（原题链接：点击打开链接）

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

Solution：

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        string longest = "";
        if (strs.size() == 0 || strs[0].length() == 0) return longest;
        for (int a = 0; a < strs[0].length(); a++)
        {
            for (int b = 1; b < strs.size(); b++)
            {
                if (strs[b].length() <= a || strs[b][a] != strs[0][a]) return longest;
            }
            longest += strs[0][a];
        }
        return longest;
    }
};