[LeetCode]Longest Common Prefix

关注

原创最新推荐文章于 2026-03-06 20:30:01 发布 2k 阅读 AI 写同款· GEO 优化 ›

Anomalib实战：从零开始构建自定义数据集的异常检测模型本文详细介绍了如何使用Anomalib 2.1.0从零开始构建自定义数据集的异常检测模型。通过实战演示，指导读者准备符合规范的数据集结构，快速上手训练Patchcore等先进算法，并完成模型推理与调优，为工业质检、医疗影像等场景提供高效的视觉异常检测解决方案。阅读详情

class Solution {
//1. find out the minimum size string as the pivot string
//2. check every other string and update the minSize
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(strs.size() == 0) return string("");
		int minSize = strs[0].size();
		int pivotIdx = 0;
		for(int i = 0; i < strs.size(); ++i)
			if(strs[i].size() < minSize)
			{
				minSize = strs[i].size();
				pivotIdx = i;
			}

		for(int i = 0; i < strs.size(); ++i)
		{
			if(i == pivotIdx) continue;
			for(int j = 0; j < minSize; ++j)
			{
				if(strs[i][j] != strs[pivotIdx][j])
				{
					minSize = j;
					break;
				}
			}
		}
		return strs[pivotIdx].substr(0, minSize);
    }
};

second time

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(strs.size() == 0) return string("");
        
        int strIdx = 0;
        //choose the smallest string first
        for(int i = 1; i < strs.size(); ++i)
            if(strs[i].size() < strs[strIdx].size()) strIdx = i;

        int commonLen = strs[strIdx].size();
        for(int i = 0; i < strs.size(); ++i)
        {
            if(i == strIdx) continue;
            int curLen = 0;
            for(int j = 0; j < strs[i].size() && j < commonLen; ++j)
            {
                if(strs[strIdx][j] == strs[i][j]) curLen++;
                else break;
            }
            commonLen = curLen;
        }
        
        return strs[strIdx].substr(0, commonLen);
    }
};

收录于