动态规划之交叉字符串

交叉字符串
给出三个字符串:s1、s2、s3，判断s3是否由s1和s2交叉构成.

 样例 1：
 输入:
 	"aabcc"
 	"dbbca"
 	"aadbbcbcac"
 输出:
 	true
 
 样例 2：
 输入:
 	"aabcc"
 	"dbbca"
 	"aadbbbaccc"
 输出:
 	false

解答：
定义DP[i][j] 为s1的前i个字符和s2的前j个字符是否匹配s3的前i+j个字符
即：s3的第i+j个字符要么和s1的第i个字符匹配，要么和s2的第j个字符匹配，并且前i+j-1个字符均是匹配的。
状态转换方程：
DP[i][j] = ((DP[i][j-1] && (s2[j-1] == s3[i+j-1])) || (DP[i-1][j] && (s1[i-1] == s3[i+j-1])));

class Solution {
public:
    /**
     * @param s1: A string
     * @param s2: A string
     * @param s3: A string
     * @return: Determine whether s3 is formed by interleaving of s1 and s2
     */
    bool isInterleave(string &s1, string &s2, string &s3) {
        // write your code here
        int m = s1.size() + 1;
        int n = s2.size() + 1;
        if(m + n - 2 != s3.length()){
            return false;
        }
        if(m == 1){
            return s2 == s3;
        }
        if(n == 1){
            return s1 == s3;
        }
        
        bool **arr = new bool*[m];
        for (int i = 0; i < m; i++) {
            arr[i] = new bool[n];
            for (int j = 0; j < n; j++) {
                arr[i][j] = false;
            }
        }
        
        arr[0][0] = true;
    	for (int i = 1; i < m; i++) {
    		arr[i][0] = (0 == s3.compare(0, i, s1, 0, i) ? true : false);
    	}
    	for (int i = 1; i < n; i++) {
    		arr[0][i] = (0 == s3.compare(0, i, s2, 0, i) ? true : false);
    	}
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                arr[i][j] = ((arr[i][j-1] && (s2[j-1] == s3[i+j-1])) || (arr[i-1][j] && (s1[i-1] == s3[i+j-1])));
            }
        }
        
        bool bRet = arr[m-1][n-1];
        for (int i = 0; i < m; i++) {
            delete[] arr[i];
        }
        delete[] arr;
        return bRet;
    }
};