LeetCode14：最长公共前缀

最新推荐文章于 2024-02-26 17:00:38 发布

独L无二

最新推荐文章于 2024-02-26 17:00:38 发布

阅读量86

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_31275315/article/details/100138800

版权

LeetCode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

该博客探讨了如何编写一个函数来找到一组字符串的最长公共前缀。当没有公共前缀时，返回空字符串。文章提供了示例并可能包含具体的解决方案。

摘要由CSDN通过智能技术生成

https://leetcode.com/problemset/top-interview-questions/

问题描述

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

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

Solution

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if(strs.empty())
            return "";
        
        string prefix = strs[0];
        for(int i = 1; i < strs.size(); i++)
        {
            int j = 0;
            while(j < strs[i].size() && strs[i][j] == prefix[j])
                j++;
            prefix = prefix.substr(0, j);
        }
        
        return prefix.size() == 0 ? "" : prefix;
    }
};