判断子序列（动态规划）

leetcode 392

    public boolean isSubsequence(String s, String t) {

        boolean table[][] = new boolean[s.length() + 1][t.length() + 1];

        for (int col=0; col<table[0].length; col++) {
            table[0][col] = true;
        }

        for (int row=1; row<table.length; row++) {
            char ch1 = s.charAt(row-1);
            for (int col=1; col<table[row].length; col++) {
                char ch2 = t.charAt(col-1);
                if (ch1==ch2) {
                    table[row][col] = table[row-1][col-1];
                } else {
                    table[row][col] = table[row][col-1];
                }
            }
        }

        boolean[] lastRow = table[table.length-1];
        return lastRow[lastRow.length-1];
    }