Distinct Subsequences

动规，从前到后用T的每一个字符i，扫描S的每一个字符j。维护一个数组的更新，表示到j位置的子串有多少子序列和到i之前字串匹配的。然后在递推的时候，只需要看i是否和j匹配，然后匹配就说明有新的j可以和之前的子串组成符合条件的串。
开始边界条件

public class Solution {
    public int numDistinct(String S, String T) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int lent = T.length();
        int lens = S.length();
        int[] countCurrent = new int[lens+1];
        int[] countPrev = new int[lens+1];
        for (int i = 0; i != lens+1; ++i)
            countPrev[i] = 1;
        for (int i = 0; i != lent; ++i){
            char target = T.charAt(i);
            for (int j = 0; j != lens; ++j){
                char temp = S.charAt(j);
                if (target == temp)
                    countCurrent[j+1] = countCurrent[j] + countPrev[j];
                else
                    countCurrent[j+1] = countCurrent[j];
            }
            countPrev = countCurrent;
            countCurrent = new int[lens+1];
        }
        return (lens > 0 ?countPrev[lens] : 0);
    }
}