Leetcode Interleaving string

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
For example,
Given:

s1 = “aabcc”,
s2 = “dbbca”,
When s3 = “aadbbcbcac”, return true.
When s3 = “aadbbbaccc”, return false.

---

看上去好像很难，其实很简单。
两点做题的建议：
1. dp的题目最好先把递推式写清楚，如果要iterate实现，矩阵的填充顺序先想清楚。
2. 写出自己的test cases

算法： dp[i][j]= ( s1(i-1)==s3(i+j-1) && dp[i-1][j] ) || ( s2(j-1)==s3(i+j-1) && dp[i][j-1] )
dp[i][j]表示s1的前i个和s2的前j个能否interleave s3的前i+j个

[code]

//dp的题目最好先把递推式写清楚
public class Solution {
    public boolean isInterleave(String s1, String s2, String s3) {
        int m=s1.length(), n=s2.length(), o=s3.length();
        if(m+n!=o)return false;
        boolean dp[][]=new boolean[m+1][n+1];
        dp[0][0]=true;
        for(int i=1;i<m+1;i++)dp[i][0]=dp[i-1][0]&&s1.charAt(i-1)==s3.charAt(i-1);
        for(int j=1;j<n+1;j++)dp[0][j]=dp[0][j-1]&&s2.charAt(j-1)==s3.charAt(j-1);
        for(int i=1;i<m+1;i++)
        {
            for(int j=1;j<n+1;j++)
            {
                boolean temp= s1.charAt(i-1)==s3.charAt(i+j-1) && dp[i-1][j];
                if(temp)
                {
                    dp[i][j]=true;
                    continue;
                }
                dp[i][j]= s2.charAt(j-1) == s3.charAt(i+j-1) && dp[i][j-1];
            }
        }
        return dp[m][n];
    }
}

/* test cases
"",234,123
"","",""
aabcc,dbbca,aadbbcbcac
aabcc,dbbca,aadbbbaccc
*/