Interleaving String (Java)

最新推荐文章于 2024-12-18 16:51:07 发布

原创最新推荐文章于 2024-12-18 16:51:07 发布 · 387 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

Leetcode hard 同时被 3 个专栏收录

35 篇文章

订阅专栏

String

31 篇文章

订阅专栏

21 篇文章

订阅专栏

本文详细探讨了如何通过算法判断两个字符串s1和s2能否交织形成第三个字符串s3，涉及字符串操作、动态规划等核心概念。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

令visited[i][j]代表取s1的前i位和s2的前j位是否可以组成s3的前i+j位。

Source

public class Solution {
    public boolean isInterleave(String s1, String s2, String s3) {
    	if(s3.length() != s1.length() + s2.length())
    		return false;
    	
    	boolean[][] visited = new boolean[s1.length() + 1][s2.length() + 1];
    	visited[0][0] = true;
    	
    	for(int i = 1; i <= s1.length() && s1.charAt(i - 1) == s3.charAt(i - 1); i++)
    		visited[i][0] = true;
    	for(int i = 1; i <= s2.length() && s2.charAt(i - 1) == s3.charAt(i - 1); i++)
    		visited[0][i] = true;
    	
    	for(int i = 1; i <= s1.length(); i++){
    		for(int j = 1; j <= s2.length(); j++){
    			char c = s3.charAt(i + j - 1);
    			if(c == s1.charAt(i - 1) && visited[i - 1][j]){
    				visited[i][j] = true;
    			}
    			if(c == s2.charAt(j - 1) && visited[i][j - 1]){
    				visited[i][j] = true;
    			}
    		}
    	}
    	return visited[s1.length()][s2.length()];
    }
}