leetcode【每日一题】97. 交错字符串 Java

题干

给定三个字符串 s1, s2, s3, 验证 s3 是否是由 s1 和 s2 交错组成的。

示例 1:

输入: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
输出: true

示例 2:

输入: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
输出: false

想法

如果s1+s2的长度不等于s3
那么肯定不行

设置dp[i][j]表示s1，s2的前i，j是否匹配s3的前i+j个
如果dp[i][j-1]都是true，然后s2正好和现在的s3匹配，那么 dp[i][j] true

即：int p=i+j-1;

dp[i][j]=dp[i][j]||(dp[i-1][j]&&s1.charAt(i-1)==s3.charAt(p));
dp[i][j]=dp[i][j]||(dp[i-1][j]&&s1.charAt(i-1)==s3.charAt(p));

Java代码

package daily;

import com.sun.xml.internal.ws.api.model.wsdl.WSDLOutput;

public class IsInterleave {
    public boolean isInterleave(String s1, String s2, String s3) {
        int len1=s1.length();
        int len2=s2.length();
        int len3=s3.length();
        if(len1+len2!=len3){
            return  false;
        }

        boolean [][]dp=new boolean[len1+1][len2+1];

        dp[0][0]=true;
         for (int i=0;i<=len1;i++){
             for (int j=0;j<=len2;j++){
                 int p=i+j-1;
                 if(i>0){
                     dp[i][j]=dp[i][j]||(dp[i-1][j]&&s1.charAt(i-1)==s3.charAt(p));
                 }
                 if (j > 0) {
                     dp[i][j]=dp[i][j]||(dp[i-1][j]&&s1.charAt(i-1)==s3.charAt(p));
                 }

             }
         }
        return dp[len1][len2];
    }

    public static  void main (String [] args) {
        IsInterleave isInterleave = new IsInterleave();
        String s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac";
        System.out.println( isInterleave.isInterleave(s1,s2,s3));
    }

}

我的leetcode代码都已经上传到我的githttps://github.com/ragezor/leetcode