Interleaving String

Fair Interleaving StringMy Submissions
54%
Accepted

Given three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2.

Example

For s1 = "aabcc" s2 = "dbbca"

    - When s3 = "aadbbcbcac", return true.

    - When s3 = "aadbbbaccc", return false.

Challenge  Expand 
Tags  Expand 

public class Solution {
    /**
     * Determine whether s3 is formed by interleaving of s1 and s2.
     * @param s1, s2, s3: As description.
     * @return: true or false.
     */
    public boolean isInterleave(String s1, String s2, String s3) {
        if (s1 == null || s2 == null || s3 == null
            || s3.length() != s1.length() + s2.length()) {
                return false;
        } 
        boolean[][] dp = new boolean[s1.length() + 1][s2.length() + 1];
        dp[0][0] = true;
        for (int i = 1; i < dp.length; i++) {
            if (s3.charAt(i - 1) == s1.charAt(i - 1)) {
                <span style="color:#ff6666;">dp[i][0] = dp[i - 1][0];</span>
            }
        }
        for (int j = 1; j < dp[0].length; j++) {
            if (s3.charAt(j - 1) == s2.charAt(j - 1)) {
                <span style="color:#ff6666;">dp[0][j] = dp[0][j - 1];</span>
            }
        }
        for (int i = 1; i < dp.length; i++) {
            for (int j = 1; j < dp[0].length; j++) {
                char temp = s3.charAt(i + j - 1);
               <span style="color:#ff0000;"> if (temp == s1.charAt(i - 1) && temp == s2.charAt(j - 1)) {
                    dp[i][j] = (dp[i - 1][j] || dp[i][j - 1]);
                } else if (temp == s1.charAt(i - 1)) {
                    dp[i][j] = dp[i - 1][j];
                } else if (temp == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i][j - 1];
                }</span>
            }
        }
        return dp[s1.length()][s2.length()];
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值