最长公共子序列(LCS)

       private static int calculateLCS(String s1, String  s2)
        {
            int len_s1 = s1.Length;
            int len_s2 = s2.Length;
            int[,] C = new int[len_s2 + 1, len_s1 + 1];

            for (int i=0;i<=len_s2;i++)
            {
                C[i, 0] = 0;
            }
            for (int j=0;j<=len_s1;j++)
            {
                C[0, j] = 0;
            }
            for (int i=1;i<=len_s2;i++)
            {
                for(int j= 1;j<=len_s1;j++)
                {
                    if (s2[i-1] == s1[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]);
                    }
                    Console.Write(C[i, j]+" ");
                }
                Console.WriteLine("");
            }
            
            return C[len_s2,len_s1];
        }