1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.Scanner;
public class Main
{
    private static int LCSLength(String sA,String sB)
    {
        int lenA = sA.length();
        int lenB = sB.length();
        int dp[][] = new int[lenA+1][lenB+1];
        for(int i = 0; i <= lenA; i++)
        {
            dp[i][0] = 0;
        }
        for(int i = 0; i <= lenB; i++)
        {
            dp[0][i] = 0;
        }
        for(int i = 1; i <= lenA; i++)
        {
            for(int j = 1; j <= lenB; j++)
            {
                // 如果一样，肯定可以添加一个，不一样，只能前面获得最大的一个
                if(sA.charAt(i-1) == sB.charAt(j-1))
                {
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
                else
                {
                    dp[i][j] = 0;
                }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX