leetcode 14. Longest Common Prefix

最新推荐文章于 2025-08-13 21:50:19 发布

原创最新推荐文章于 2025-08-13 21:50:19 发布 · 318 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

数据结构与算法同时被 2 个专栏收录

213 篇文章

订阅专栏

196 篇文章

订阅专栏

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

class Solution {
public:
	string longestCommonPrefix(vector<string>& strs) {
		if (strs.empty())
			return "";
		int minlen = strs[0].length();
		for (int i = 1; i < strs.size(); i++)
			if (strs[i].length() < minlen)
				minlen = strs[i].length();
		string cp = string(strs[0].begin(), strs[0].begin() + minlen);
		for (int i = 1; i < strs.size(); i++)
		{
			int k = 0;
			while (k < cp.length() && string(cp.begin(), cp.begin() + cp.length() - k) !=
				string(strs[i].begin(), strs[i].begin() + cp.length() - k))
				k++;
			if (k == cp.length())
				return "";
			cp = string(cp.begin(), cp.begin() + cp.length() - k);
		}
		return cp;
	}
};