LeetCode | 14. Longest Common Prefix

最新推荐文章于 2024-09-12 00:15:00 发布

1LOVESJohnny

最新推荐文章于 2024-09-12 00:15:00 发布

阅读量115

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/iLOVEJohnny/article/details/84668974

LeetCode 专栏收录该内容

285 篇文章

订阅专栏

本文介绍了一种算法，用于查找一组字符串中的最长公共前缀。通过遍历字符串数组和比较字符，该方法能够高效地确定所有字符串共享的最长前缀。如果不存在公共前缀，则返回空字符串。

题目：

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.

代码：

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.size() < 1)
			return "";
		string cmn = "";
		for (int j = 0; j < strs[0].size(); j++)
		{
			char cur = strs[0][j];
			for (int i = 1; i < strs.size(); i++)
			{
				if (j > strs[i].size() || strs[i][j] != cur)
				{
					return cmn;
				}
			}
			cmn += cur;
		}
		return cmn;
    }
};