【leetcode】14. Longest Common Prefix

最新推荐文章于 2022-03-20 08:23:53 发布

lgs770950672

最新推荐文章于 2022-03-20 08:23:53 发布

阅读量171

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/lgs770950672/article/details/51462421

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

/**
 * Write a function to find the longest common prefix string amongst an array of strings.
 */
#include <iostream>
#include <string>
#include <vector>
using namespace std;

string longestCommonPrefix(vector<string>& strs) 
{
    if (strs.empty())
        return "";

    string prefix = strs[0];    
    int j = 0;

    for (int i = 1; i < strs.size(); i++)
    {
        j = 0;      
        while (prefix.length() > 0 && strs[i].length() > 0 && prefix[j] && strs[i][j])
        {
            if (prefix[j] == strs[i][j])
            {
                j++;
            }
            else
            {
                break;
            }
        }
        prefix = prefix.substr(0, j);
    }   
    return prefix;
}

int main()
{
    vector<string> strarr = {"abcd", "abef", "abfdd"};

    cout << longestCommonPrefix(strarr);

    system("pause");
    return 0;
}