LeetCode 97 Interleaving String

本文主要是介绍LeetCode 97 Interleaving String，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

1.

2.

class Solution {public boolean isInterleave(String s1, String s2, String s3) {if(s1.length()+s2.length()!=s3.length()){return false;}boolean[][] dp=new boolean[s1.length()+1][s2.length()+1];//dp[i][j] 表示的是 s2 的前 i 个字符和 s1 的前 j 个字符是否匹配 s3 的前 i+j 个字符dp[0][0] = true;for (int i = 1; i <= s1.length(); ++i) {dp[i][0] = dp[i - 1][0] && (s1.charAt(i - 1) == s3.charAt(i - 1));}for (int j = 1; j <= s2.length(); ++j) {dp[0][j] = dp[0][j - 1] && (s2.charAt(j - 1) == s3.charAt(j - 1));}for (int i = 1; i <= s1.length(); ++i) {for (int j = 1; j <= s2.length(); ++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[s1.length()][s2.length()];        }
}

 

3.

    public static void isFixed(String s1, String s2, String s3) {if(s1.length()+s2.length()!=s3.length()){System.out.println("FALSE");}boolean[] dp=new boolean[s2.length()+1];//dp[i][j] 表示的是 s2 的前 i 个字符和 s1 的前 j 个字符是否匹配 s3 的前 i+j 个字符for(int i=0;i<=s1.length();i++){for(int j=0;j<=s2.length();j++){if(i==0&&j==0){dp[j]=true;}else if(i==0){dp[j]=dp[j-1]&&s2.charAt(j-1)==s3.charAt(i+j-1);}else if(j==0){dp[j]=dp[j]&&s1.charAt(i-1)==s3.charAt(i+j-1);}else{dp[j]= (dp[j-1]&&s2.charAt(j-1)==s3.charAt(i+j-1))||(dp[j]&&s1.charAt(i-1)==s3.charAt(i+j-1));}}}if(dp[s2.length()]==true){System.out.println("TRUE");}else{System.out.println("FALSE");}}

 

这篇关于LeetCode 97 Interleaving String的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---