目標(biāo)：打印出給定字符串的所有的最長公共子序列。

示例：第一行：acb，第二行abc；輸出結(jié)果：ac，ab

正確程序：

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class LCS {
    private static int[][] dp;
    private static String s1, s2;
    private final static Set<String> set = new HashSet<>();
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        s1 = in.nextLine(); int len1 = s1.length();
        s2 = in.nextLine(); int len2 = s2.length();
        //dp結(jié)果計(jì)算
        dp = new int[len1+1][len2+1];
        for (int i = 1; i < len1+1; i++) {
            for (int j = 1; j < len2+1; j++) {
                if (s1.charAt(i-1) == s2.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]);
                }
            }
        }
        //打印dp結(jié)果
        for (int i = 0; i < len1+1; i++) {
            for (int j = 0; j < len2+1; j++) {
                System.out.print(dp[i][j] + " ");
            }
            System.out.println();
        }
        //輸出所有的LCS
        String res = "";
        traceBack(len1, len2, res);
        System.out.println(set.toString());
    }

    private static void traceBack(int len1, int len2, String res) {
        while (len1 > 0 && len2 > 0) {
            if (s1.charAt(len1-1) == s2.charAt(len2-1)) {
                res += s1.charAt(len1-1);
                //res.append(s1.charAt(len1-1));
                len1--; len2--;
            } else {
                if (dp[len1][len2-1] > dp[len1-1][len2]) {
                    len2--;
                } else if (dp[len1][len2-1] < dp[len1-1][len2]) {
                    len1--;
                } else {
                    traceBack(len1-1, len2, res);
                    traceBack(len1, len2-1, res);
                    return;
                }
            }
        }
        set.add(new StringBuilder(res).reverse().toString());
    }
}

錯誤代碼，求大佬指點(diǎn)：

示例：第一行：acb，第二行abc；輸出結(jié)果：ac，abac，求解哪里出問題了？謝謝

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * 問題：利用StringBuilder代替String就會有問題
 */
public class LCS {
    private static int[][] dp;
    private static String s1, s2;
    private final static Set<String> set = new HashSet<>();
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        s1 = in.nextLine(); int len1 = s1.length();
        s2 = in.nextLine(); int len2 = s2.length();
        //dp結(jié)果計(jì)算
        dp = new int[len1+1][len2+1];
        for (int i = 1; i < len1+1; i++) {
            for (int j = 1; j < len2+1; j++) {
                if (s1.charAt(i-1) == s2.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]);
                }
            }
        }
        for (int i = 0; i < len1+1; i++) {
            for (int j = 0; j < len2+1; j++) {
                System.out.print(dp[i][j] + " ");
            }
            System.out.println();
        }
        //輸出所有的LCS
        StringBuilder res = new StringBuilder();
        traceBack(len1, len2, res);
        System.out.println(set.toString());
    }

    private static void traceBack(int len1, int len2, StringBuilder res) {
        while (len1 > 0 && len2 > 0) {
            if (s1.charAt(len1-1) == s2.charAt(len2-1)) {
                res.append(s1.charAt(len1-1));
                len1--; len2--;
            } else {
                if (dp[len1][len2-1] > dp[len1-1][len2]) {
                    len2--;
                } else if (dp[len1][len2-1] < dp[len1-1][len2]) {
                    len1--;
                } else {
                    traceBack(len1-1, len2, res);
                    traceBack(len1, len2-1, res);
                    return;
                }
            }
        }
        set.add(new StringBuilder(res).reverse().toString());
    }
}