最长公共子序列/字符串(LCSubsequence/Substring)

1.1 计算最长公共子序列的长度

public static int longestCommonSubsequence1(String text1, String text2) {
    int[][] dp = new int[text1.length()+1][text2.length()+1];

    for(int i = 1; i < text1.length()+1; i++) {
        for(int j = 1; j < text2.length()+1; j++) {
            if(text1.charAt(i-1) == text2.charAt(j-1)) {
                dp[i][j] = dp[i-1][j-1] + 1;
            }else {
                dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
            }
        }
    }

    return dp[text1.length()][text2.length()];
}

1.2 获取所有的最长公共子序列（未完待续）

2.1 计算最长公共子字符串长度

public static int longestCommonSubstring1(String text1, String text2) {
    int[][] dp = new int[text1.length()+1][text2.length()+1];
    int len = 0;
    for(int i = 1; i < text1.length()+1; i++) {
        for(int j = 1; j < text2.length()+1; j++) {
            if(text1.charAt(i-1) == text2.charAt(j-1)) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
                len = Math.max(len, dp[i][j]);
            }
        }
    }

    return len;
}

2.2 获取所有的最长公共子字符串

public static List<String> longestCommonSubstring2(String text1, String text2) {
    int[][] dp = new int[text1.length()+1][text2.length()+1];
    List<Integer> positions = new ArrayList<>(); // the ending position of the common substring in text1
    int len = 0;
    for(int i = 1; i < text1.length()+1; i++) {
        for(int j = 1; j < text2.length()+1; j++) {
            if(text1.charAt(i-1) == text2.charAt(j-1)) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
                if(dp[i][j] > len) {
                    len = dp[i][j];
                    positions.clear();
                    positions.add(i);
                }else if(dp[i][j] == len && len > 0) {
                    positions.add(i);
                }
            }
        }
    }

    Set<String> res = new HashSet<>(); // result
    for(int position: positions) {
        res.add(text1.substring(position-len, position));
    }

    return (new ArrayList<>(res));
}
```