题解 | #最长公共子串#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * longest common substring
     * @param str1 string字符串 the string
     * @param str2 string字符串 the string
     * @return string字符串
     */
    string LCS(string str1, string str2) {
        // write code here
        int length = 0;
        string result = "";
        for(int i = 0; i < str1.length(); i++){
            for(int j = 0; j < str2.length(); j++){
                int temp = 0;
                string temps = "";
                for(int x = i, y = j; x < str1.length() && y < str2.length() && str1[x] == str2[y]; x++, y++){
                    temp++;
                    temps += str1[x];
                }
                if(length < temp){
                    length = temp;
                    result = temps;
                }
            }
        }
        return result;
    }
};

穷举法解最长公共子串