97. Interleaving String(dp)
来源:互联网 发布:hack软件 编辑:程序博客网 时间:2024/06/04 18:44
题目:
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.
Subscribe to see which companies asked this question
深搜:
超时
public class Solution { public boolean isInterleave(String s1, String s2, String s3) { if(s1.length()+s2.length()!=s3.length())return false; return dfs(s1,s2,s3,0,0,0); } private boolean dfs(String s1,String s2,String s3, int l1,int l2,int l3) { if(l3 == s3.length())return true; if(s1.length()>l1 && s1.charAt(l1)==s3.charAt(l3)) { if(dfs(s1,s2,s3,l1+1,l2,l3+1)) { return true; } } if(s2.length()>l2 && s2.charAt(l2)==s3.charAt(l3)) { if(dfs(s1,s2,s3,l1,l2+1,l3+1)) { return true; } } return false; }}
动态规划:
dp[i][j]表示s1的前i个和s2的前j个能构成s3的前i+j个
动态规划方程:dp[i][j] = dp[i - 1][j] && s2[i - 1] == s3[i + j - 1] || dp[i][j - 1] && s1[i][j - 1] == s3[i + j - 1]
public 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[0][0]=true;for(int i=1;i<s1.length()+1;i++){if(s1.charAt(i-1)==s3.charAt(i-1) && dp[i-1][0]){dp[i][0]=true;}}for(int i=1;i<s2.length()+1;i++){if(s2.charAt(i-1) == s3.charAt(i-1)&& dp[0][i-1]){dp[0][i]=true;}}for(int i=1;i<s1.length()+1;i++){for(int j=1;j<s2.length()+1;j++){dp[i][j] = (s1.charAt(i-1)==s3.charAt(i+j-1) && dp[i-1][j])||(s2.charAt(j-1)==s3.charAt(i+j-1) && dp[i][j-1]);}}return dp[s1.length()][s2.length()];}}
0 0
- 97. Interleaving String(dp)
- Leetcode 97 - Interleaving String(dp)
- [leetcode] Interleaving String@DP
- 【DP】Interleaving String
- Interleaving String(DP应用)
- Leetcode dp Interleaving String
- Interleaving String [leetcode] DP
- [LeetCode.DP]Interleaving String
- LeetCode Interleaving String DP
- leetcode---interleaving-string---dp
- Posts Tagged 【dp】Interleaving String
- leetcode 97. Interleaving String(字符串交错出现) DFS深度优先遍历+DP
- leetcode: 97. Interleaving String 递归与DP两种算法
- LeetCode 97. Interleaving String(字符串交织)
- LeetCode 97. Interleaving String
- [LeetCode]97.Interleaving String
- [Leetcode] 97. Interleaving String
- LeetCode --- 97. Interleaving String
- 9/21/16 学习记录
- Android通用流行框架
- GIS笔记——R*树:一种高效且健壮的点和矩形访问方法(节译)
- java/php/c#版rsa签名以及java验签实现
- 不写代码,快速实现px转换成dp
- 97. Interleaving String(dp)
- 如何用C#读写配置文件(转载自网络)
- 利用三方PagerBottomTabStrip完成底部的page滑动效果
- 在VMware中,双击鼠标左键,ctrl键粘滞问题
- linux开机自动启动内核模块
- cocos2d-x spine3.0导出2.0
- PHP Web相片资源管理模块--JAlbum
- php+ngnix windows下配置
- 【安卓】google gsp 开发使用为了支持5.0以上的设备