392. 判断子序列

392. 判断子序列

class Solution {
    public boolean isSubsequence(String s, String t) {
        boolean[][] dp = new boolean[s.length() + 1][t.length() + 1];
        for(int i = 0;i < t.length() + 1;i++) dp[0][i] = true;
        for(int i = 1; i < s.length() + 1;i++){
            for(int j = 1; j < t.length() + 1;j++){
                if(s.charAt(i - 1) == t.charAt(j - 1)) dp[i][j] = dp[i - 1][j - 1];
                else dp[i][j] = dp[i][j - 1];
            }
        }
        return dp[s.length()][t.length()];
    }
}