【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.

分析：题目要求判断三个字符串的关系是否满足s1和s2混合拼接成s3，刚开始理所当然的认为用三个指针移位来做，后来看到用例 s1 = "aa" ，s2=“ab”，s3=“aaba”，发现当s1和s2当前为字符相同时，取s1还是s2的字符，会影响后续能否能构成s3。

正确思路是用动态规划做，建立二维数组，dp[i][j]表示当前s1长度为i，s2长度为j，s3长度为i+j时，是否满足s1和s2拼接成s3。dp[i][j]与dp[i-1][j]、dp[i][j-1]的布尔值有关。

Java AC代码如下：

	public boolean isInterleave(String s1, String s2, String s3) {
		if (s1 == null || s2 == null || s3 == null
				|| s1.length() + s2.length() != s3.length()) {
			return false;
		}
		int len1 = s1.length();
		int len2 = s2.length();
		boolean dp[][] = new boolean[len1 + 1][len2 + 1];
		dp[0][0] = true;
		for (int i = 1; i <= len2; i++) {
			if (s2.charAt(i - 1) == s3.charAt(i - 1)) {
				dp[0][i] = true;
			} else {
				break;
			}
		}
		for (int i = 1; i <= len1; i++) {
			if (s1.charAt(i - 1) == s3.charAt(i - 1)) {
				dp[i][0] = true;
			} else {
				break;
			}
		}
		for (int i = 1; i <= len1; i++) {
			for (int j = 1; j <= len2; j++) {
				dp[i][j] = (dp[i - 1][j] && s1.charAt(i - 1) == s3.charAt(i + j
						- 1))
						|| (dp[i][j - 1] && s2.charAt(j - 1) == s3.charAt(i + j
								- 1));
			}
		}
		return dp[len1][len2];
	}