leetcode22: longest common prefix

最新推荐文章于 2025-09-13 19:30:09 发布

weixin_34040079

最新推荐文章于 2025-09-13 19:30:09 发布

阅读量49

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++

原文链接：http://www.cnblogs.com/xishibean/archive/2013/01/09/2951401.html

本文提供了一种寻找字符串数组中最长公共前缀的方法，并通过C++实现了一个具体示例。该算法适用于连续前缀子串的情况，不同于通用子串查找。

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

reminders: 1.

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        // in this question, common prefix means continuious predix substring which is different from the common substring in CLRS.
        // remember this, comfirm it with interviwer before starting to solve problem.
        if( strs.size() ==0) return "";
        if( strs.size() < 2) return strs[0];
        //if( strs[0].size() == 0 ) return ""; this statement is useless, because if the size equeals to 0, it won't go into loop.
        
        char c;
        string rel;
        for( int i=0; i<strs[0].size(); i++) {
            c = strs[0][i];
            for( int j=1; j<strs.size(); j++) {
                if( strs[j][i] != c || strs[j].size() <= i ) {
                    return rel;
                }
            }
            
            rel.push_back( c );
        }
        
        return rel;
    }
};

转载于:https://www.cnblogs.com/xishibean/archive/2013/01/09/2951401.html