2267. 检查是否有合法括号字符串路径

src/list.rs

@@ -7,7 +7,7 @@ pub struct ListNode {
 
 impl ListNode {
   #[inline]
-  fn new(val: i32) -> Self {
+  pub fn new(val: i32) -> Self {
     ListNode {
       next: None,
       val

src/main.rs

@@ -1,29 +1,66 @@
+use crate::arr::make_char_matrix;
+use std::collections::HashSet;
+
 mod arr;
+mod list;
+
 struct Solution {}
 impl Solution {
-    pub fn min_distance(word1: String, word2: String) -> i32 {
-        let mut dp = vec![vec![0; word2.len() + 1]; word1.len() + 1];
-        let word1 = word1.chars().collect::<Vec<char>>();
-        let word2 = word2.chars().collect::<Vec<char>>();
-        for i in 1..=word1.len() {
-            dp[i][0] = dp[i - 1][0] + 1;
+    pub fn has_valid_path(grid: Vec<Vec<char>>) -> bool {
+        if grid[0][0] == ')'
+            || grid[grid.len() - 1][grid[0].len() - 1] == '('
+            || (grid.len() + grid[0].len()) % 2 == 0
+        {
+            return false;
         }
-        for i in 1..=word2.len() {
-            dp[0][i] = dp[0][i - 1] + 1;
-        }
-        for i in 0..word1.len() {
-            for j in 0..word2.len() {
-                dp[i + 1][j + 1] = (dp[i][j] + if word1[i] != word2[j] { 1 } else { 0 })
-                    .min(dp[i][j + 1] + 1)
-                    .min(dp[i + 1][j] + 1);
+        let mut matrix = vec![vec![Option::<HashSet<i32>>::None; grid[0].len()]; grid.len()];
+        matrix[0][0] = Some(HashSet::from_iter([10000]));
+        for i in 0..=(grid.len() - 1 + grid[0].len() - 1) {
+            for j in 0..=i {
+                if grid.len() > j && grid[0].len() > i - j {
+                    if grid.len() > j + 1 {
+                        let (rsrc, rdst) = matrix.split_at_mut(j + 1);
+                        let dst = rdst[0][i - j].get_or_insert_with(HashSet::new);
+                        let src = rsrc[j][i - j].as_ref().unwrap();
+                        if grid[j + 1][i - j] == '(' {
+                            dst.extend(src.iter().map(|&x| x + 10000));
+                        } else {
+                            dst.extend(
+                                src.iter()
+                                    .filter(|&x| x / 10000 > x % 10000)
+                                    .map(|&x| x + 1),
+                            );
+                        }
+                    }
+                    if grid[0].len() > i - j + 1 {
+                        let (rsrc, rdst) = matrix[j].split_at_mut(i - j + 1);
+                        let dst = rdst[0].get_or_insert_with(HashSet::new);
+                        let src = rsrc[i - j].as_ref().unwrap();
+                        if grid[j][i - j + 1] == '(' {
+                            dst.extend(src.iter().map(|&x| x + 10000));
+                        } else {
+                            dst.extend(
+                                src.iter()
+                                    .filter(|&x| x / 10000 > x % 10000)
+                                    .map(|&x| x + 1),
+                            );
+                        }
+                    }
+                }
             }
         }
-        dp[word1.len()][word2.len()]
+        matrix[grid.len() - 1][grid[0].len() - 1].as_ref()
+            .unwrap()
+            .iter()
+            .any(|&x| x / 10000 == x % 10000)
     }
 }
+
 fn main() {
     println!(
         "{:?}",
-        Solution::min_distance("intention".to_string(), "execution".to_string())
+        Solution::has_valid_path(make_char_matrix(
+            r#"[["(","(","("],[")","(",")"],["(","(",")"],["(","(",")"]]"#
+        ))
     );
 }

src/tree.rs

@@ -15,7 +15,19 @@ impl TreeNode {
         TreeNode { val, left: None, right: None }
     }
 }
-
+pub fn build_tree_from_str(s: &str) -> Option<Rc<RefCell<TreeNode>>> {
+    // [-10,9,20,null,null,15,7]
+    let s = s.trim_matches(&['[', ']'][..]).split(',').map(|x| x.trim()).collect::<Vec<_>>();
+    let mut vals = vec![];
+    for x in s {
+        if x == "null" {
+            vals.push(None);
+        }else {
+            vals.push(Some(i32::from_str_radix(x, 10).unwrap()));
+        }
+    }
+    build_tree(&vals)
+}
 pub fn build_tree(vals: &[Option<i32>]) -> Option<Rc<RefCell<TreeNode>>> {
     if vals.is_empty() || vals[0].is_none() {
         return None;