lintcode:Longest Common Substring

最新推荐文章于 2019-01-13 06:58:34 发布

martin_liang

最新推荐文章于 2019-01-13 06:58:34 发布

阅读量567

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 C++/C lintcode

本文链接：https://blog.youkuaiyun.com/martin_liang/article/details/45775629

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

lintcode

66 篇文章

订阅专栏

本文介绍了一种算法，用于在两个字符串中找到最长连续公共子串，并返回其长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two strings, find the longest common substring.

Return the length of it.

Example

Given A="ABCD", B="CBCE", return 2.

Note

The characters in substring should occur continuously in original string. This is different with subsequence.

class Solution {
public:    
    /**
     * @param A, B: Two string.
     * @return: the length of the longest common substring.
     */
    int longestCommonSubstring(string &A, string &B) {
        // write your code here
        
        int sizeA = A.size();
        int sizeB = B.size();
        int  max_len = 0;
        
        for (int i=0; i<sizeA; i++)
        {
            int  cur_i = i;
            int  cur_len = 0;
            bool match = false;
            
            for (int j=0; j<sizeB && cur_i<sizeA; j++)
            {
                if (A[cur_i] == B[j])
                {
                    if (!match)
                    {
                        match = true;
                        cur_i = i+1;
                        cur_len = 1;
                    }
                    else
                    {
                        cur_i++;
                        cur_len++;
                    }
                    
                    max_len = max(max_len, cur_len);
                }
                
                else if (A[cur_i] != B[j])
                {
                    match = false;
                    cur_i = i;
                    cur_len = 0;
                }
            }
        }
        
        return max_len;
    }
};