Scramble String 动态规划
来源:互联网 发布:数据库查找编写的代码 编辑:程序博客网 时间:2024/05/16 04:00
动态规划问题,涉及到动态规划问题基本思想是尽量使用数组
public boolean isScramble(String s1, String s2) {
if (s1.length() != s2.length()) {
return false;
}
int n = s1.length();
if (s1.equals(s2)) {
return true;
}
boolean[][][] dp = new boolean[n][n][n+1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j][1] = (s1.charAt(i) == s2.charAt(j));
}
}
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
for (int j = 0; j<=n-len; j++) {
for(int k=1;k<len;k++)
if((dp[i][j][k] && dp[i+k][j+k][len-k])||(dp[i][j+len-k][k] && dp[i+k][j][len-k])){
dp[i][j][len]=true;
}
}
}
}
return dp[0][0][n];
}
if (s1.length() != s2.length()) {
return false;
}
int n = s1.length();
if (s1.equals(s2)) {
return true;
}
boolean[][][] dp = new boolean[n][n][n+1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j][1] = (s1.charAt(i) == s2.charAt(j));
}
}
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
for (int j = 0; j<=n-len; j++) {
for(int k=1;k<len;k++)
if((dp[i][j][k] && dp[i+k][j+k][len-k])||(dp[i][j+len-k][k] && dp[i+k][j][len-k])){
dp[i][j][len]=true;
}
}
}
}
return dp[0][0][n];
}
阅读全文
0 0
- Scramble String 动态规划
- LeetCode Scramble String(动态规划)
- LeetCode题目:Scramble String,三维动态规划
- 动态规划——scramble-string
- leetcode 87 Scramble String(动态规划)
- 算法学习之动态规划(leetcode 87. Scramble String)
- scramble string (使用动态规划和递归做)
- 算法刷题心得:动态规划 scramble-string
- 87. Scramble String(三维动态规划+形似map的数组使用技巧)
- Scramble String
- Scramble String
- Scramble String
- Scramble String
- Scramble String
- Scramble String
- Scramble String
- Scramble String
- Scramble String
- 跨域问题解决
- 阶乘之和
- MySQL服务器配置复制
- ARM开发(8)基于STM32的窗口看门狗
- 设计模式之禅笔记-单例模式
- Scramble String 动态规划
- HDU 6044 Limited Permutation(递归)
- 2017.7.30 玩具装箱 思考记录
- B1002
- [图形学] 5行C代码实现的分形图案
- windows 7+ubuntu 14.04双系统安装
- 通俗易懂的Java序列化原理
- Rust:Programming Rust:所有权
- Spring boot 自动配置套路