-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy paths0087_scramble_string.rs
More file actions
57 lines (49 loc) · 1.52 KB
/
s0087_scramble_string.rs
File metadata and controls
57 lines (49 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#![allow(unused)]
pub struct Solution {}
impl Solution {
// O(n^4) O(n^3)
pub fn is_scramble(s1: String, s2: String) -> bool {
if s1.len() == 0 {
return true;
}
if s1.len() == 1 {
return s1 == s2;
}
let mut is_scram = vec![vec![vec![false; s1.len()]; s1.len()]; s1.len() + 1];
let s1_chs = s1.chars().collect::<Vec<char>>();
let s2_chs = s2.chars().collect::<Vec<char>>();
for i in 0..s1.len() {
for j in 0..s1.len() {
is_scram[1][i][j] = s1_chs[i] == s2_chs[j];
}
}
for len in 2..=s1.len() {
for i in 0..=s1.len() - len {
for j in 0..=s1.len() - len {
is_scram[len][i][j] = false;
for k in 1..len {
if is_scram[len][i][j] {
break;
}
is_scram[len][i][j] = is_scram[len][i][j]
|| (is_scram[k][i][j] && is_scram[len - k][i + k][j + k]);
is_scram[len][i][j] = is_scram[len][i][j]
|| (is_scram[k][i + len - k][j] && is_scram[len - k][i][j + k]);
}
}
}
}
is_scram[s1.len()][0][0]
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_87() {
assert_eq!(
Solution::is_scramble("great".to_string(), "rgeat".to_string()),
true
);
}
}