动态规划求最长公共序列

序列不连续：

import java.io.IOException;import java.util.Arrays;import java.util.Scanner;/** * Created by Tao on 2017/8/7. */public class Main {    public static void main(String[] args) throws IOException {        String str1 = "a1s2d34";        String str2 = "1234";        int[][] dp = new int[str2.length() + 1][str1.length() + 1];        for (int i = 1; i <= str2.length(); i++) {            for (int j = 1; j <= str1.length(); j++) {                if (str2.charAt(i-1) == str1.charAt(j-1)) {                    dp[i][j] = dp[i-1][j-1] + 1;                } else {                    dp[i][j] = Math.max(dp[i][j-1],dp[i-1][j]);                }            }        }        System.out.println(dp[str2.length()][str1.length()]);    }}