29. 交叉字符串

29. 交叉字符串

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

样例

样例 1：

输入:

"aabcc"

"dbbca"

"aadbbcbcac"

输出:

true

样例 2：

输入:

""

""

"1"

输出:

false

样例 3：

输入:

"aabcc"

"dbbca"

"aadbbbaccc"

输出:

false

挑战

要求时间复杂度为O(n2)或者更好

/**

     * @param s1: A string

     * @param s2: A string

     * @param s3: A string

     * @return: Determine whether s3 is formed by interleaving of s1 and s2

     */

    public boolean isInterleave(String s1, String s2, String s3) {

        // write your code here

        if (null == s1 || null == s2 || null == s3 || s1.length() + s2.length() != s3.length())

            return false;

        if (s1.length() <= 0 && s2.length() <= 0 && s3.length() <= 0)

            return true;

        boolean[][] common = new boolean[s1.length() + 1][s2.length() + 1];

        for (int i = 1; i <= s1.length(); i++) {

            if (s1.charAt(i - 1) == s3.charAt(i - 1)) {

                common[i][0] = true;

            }

        }





        for (int i = 1; i <= s2.length(); i++) {

            if (s2.charAt(i - 1) == s3.charAt(i - 1)) {

                common[0][i] = true;

            }

        }





        for (int i = 1; i <= s1.length(); i++) {

            for (int j = 1; j <= s2.length(); j++) {

                if (s1.charAt(i - 1) == s3.charAt(i + j - 1)) {

                    common[i][j] = common[i - 1][j];

                }

                if (common[i][j]) {

                    continue;

                }

                if (s2.charAt(j - 1) == s3.charAt(i + j - 1)) {

                    common[i][j] = common[i][j - 1];

                }

            }

        }

        return common[s1.length()][s2.length()];





    }

}