最大公共子串，最大公共子序列

/// <summary>
        /// 最大公共子串
        /// </summary>
        /// <param name="A"></param>
        /// <param name="B"></param>
        /// <returns></returns>
        public static int LCSubstr(String A, String B)
        {
            int max = 0; //记录最长子串的大小   
            char[] AStr = A.ToCharArray();
           
            char[] BStr = B.ToCharArray();
            int lenA = AStr.Length;
            int lenB = BStr.Length;
            int x = 0; //记录最长子串结束的位置
            int y = 0;
            int[,] a = new int[lenA, lenB]; //初始化矩阵
            for (int i = 0; i < lenA; i++)
            {
                for (int j = 0; j < lenB; j++)
                {
                    if (AStr[i] == BStr[j])
                    {
                        if (i == 0 || j == 0)
                        {
                            a[i, j] = 1;
                        }
                        else
                        {
                            a[i, j] = a[i - 1, j - 1] + 1;
                        }
                        if (a[i, j] > max)
                        {
                            max = a[i, j];
                            x = i;
                            y = j;
                        }
                    }
                    else
                        a[i, j] = 0;
                }
            }
            return max;
        }
        /// <summary>
        /// 最大公共子序列
        /// </summary>
        /// <param name="str1"></param>
        /// <param name="str2"></param>
        /// <returns></returns>
        public static int LCS(String str1, String str2)
        {
            int len1 = str1.Length;
            int len2 = str2.Length;
            int[,] c = new int[len1 + 1, len2 + 1];
            for (int i = 0; i <= len1; i++)
            {
                for (int j = 0; j <= len2; j++)
                {
                    if (i == 0 || j == 0)
                    {
                        c[i, j] = 0;
                    }
                    else if (str1[i - 1] == str2[j - 1])
                    {
                        c[i, j] = c[i - 1, j - 1] + 1;
                    }
                    else
                    {
                        c[i, j] = Math.Max(c[i - 1, j], c[i, j - 1]);
                    }
                }
            }
            return c[len1, len2];
        }