Longest Common Prefix

最新推荐文章于 2019-05-05 10:33:12 发布

kassical

最新推荐文章于 2019-05-05 10:33:12 发布

阅读量580

点赞数

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

本文链接：https://blog.csdn.net/kassical/article/details/38669763

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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.size() == 0)
			return "";

		string prefix = strs[0];
		for (int i = 1; i < strs.size(); i++) {
			if (prefix.length() == 0 || strs[i].length() == 0)  
				return "";
			int j = 0;
			int n = min(prefix.length(), strs[i].length());
			while (j < n && prefix[j] == strs[i][j])
				j++;

			prefix = prefix.substr(0, j);
		}
		return prefix;
	}
};