说明：  这个源代码描述的是给定两个字符串，根据动态规划算法来计算出这两个字符串的最大子字符串。
(Described in this source code is given two strings, according to the dynamic programming algorithm to calculate the largest substring of two strings.)