72. 编辑距离

src/arr.rs

@@ -1,3 +1,9 @@
+pub fn make_string_arr(s: &str) -> Vec<String> {
+    s.trim_matches(&['[', ']'][..])
+        .split(',')
+        .map(|s| s.trim_matches(&['"',' ']).to_string())
+        .collect()
+}
 pub fn make_arr(s: &str) -> Vec<i32> {
     s.trim_matches(&['[', ']'][..])
         .split(',')
@@ -13,13 +19,186 @@ pub fn make_arr(s: &str) -> Vec<i32> {
 }
 
 pub fn make_matrix(s: &str) -> Vec<Vec<i32>> {
-    s.trim_matches(&['[', ']'][..])
-        .split("],[")
-        .map(|row| {
-            row.trim_matches(&['[', ']'][..])
+    let s = s.trim();
+
+    // Remove only the outermost pair of brackets if present, e.g. "[[1,2],[3,4]]" -> "[1,2],[3,4]"
+    let inner = if s.len() >= 2 && s.starts_with('[') && s.ends_with(']') {
+        &s[1..s.len() - 1]
+    } else {
+        s
+    }
+    .trim();
+
+    if inner.is_empty() {
+        return Vec::new();
+    }
+
+    let bytes = inner.as_bytes();
+    let mut i = 0usize;
+    let mut rows: Vec<Vec<i32>> = Vec::new();
+    while i < bytes.len() {
+        // find next '['
+        while i < bytes.len() && bytes[i] != b'[' {
+            i += 1;
+        }
+        if i >= bytes.len() {
+            break;
+        }
+        let start = i + 1; // byte index after '['
+        i = start;
+        // find matching ']'
+        while i < bytes.len() && bytes[i] != b']' {
+            i += 1;
+        }
+        let end = i; // exclusive
+        // move i past ']' for next iteration (if in bounds)
+        if i < bytes.len() {
+            i += 1;
+        }
+
+        if end <= start {
+            // empty row like []
+            rows.push(Vec::new());
+            continue;
+        }
+
+        let row_str = &inner[start..end];
+        let row_vec: Vec<i32> = row_str
             .split(',')
-                .map(|x| x.trim().parse::<i32>().unwrap())
-                .collect()
+            .map(|x| {
+                let x = x.trim();
+                if x == "null" || x.is_empty() {
+                    -1
+                } else {
+                    x.parse::<i32>().unwrap()
+                }
             })
-        .collect()
+            .collect();
+        rows.push(row_vec);
+    }
+
+    rows
+}
+
+pub fn make_char_matrix(s: &str) -> Vec<Vec<char>> {
+    let s = s.trim();
+
+    // Remove only the outermost pair of brackets if present, e.g. "[[1,2],[3,4]]" -> "[1,2],[3,4]"
+    let inner = if s.len() >= 2 && s.starts_with('[') && s.ends_with(']') {
+        &s[1..s.len() - 1]
+    } else {
+        s
+    }
+        .trim();
+
+    if inner.is_empty() {
+        return Vec::new();
+    }
+
+    let bytes = inner.as_bytes();
+    let mut i = 0usize;
+    let mut rows: Vec<Vec<char>> = Vec::new();
+    while i < bytes.len() {
+        // find next '['
+        while i < bytes.len() && bytes[i] != b'[' {
+            i += 1;
+        }
+        if i >= bytes.len() {
+            break;
+        }
+        let start = i + 1; // byte index after '['
+        i = start;
+        // find matching ']'
+        while i < bytes.len() && bytes[i] != b']' {
+            i += 1;
+        }
+        let end = i; // exclusive
+        // move i past ']' for next iteration (if in bounds)
+        if i < bytes.len() {
+            i += 1;
+        }
+
+        if end <= start {
+            // empty row like []
+            rows.push(Vec::new());
+            continue;
+        }
+
+        let row_str = &inner[start..end];
+        let row_vec: Vec<char> = row_str
+            .split(',')
+            .map(|x| {
+                let x = x.trim().trim_matches('"');
+                if x == "null" || x.is_empty() {
+                    ' '
+                } else {
+                    x.to_string().chars().nth(0).unwrap()
+                }
+            })
+            .collect();
+        rows.push(row_vec);
+    }
+
+    rows
+}
+pub fn make_string_matrix(s: &str) -> Vec<Vec<String>> {
+    let s = s.trim();
+
+    // Remove only the outermost pair of brackets if present, e.g. "[[1,2],[3,4]]" -> "[1,2],[3,4]"
+    let inner = if s.len() >= 2 && s.starts_with('[') && s.ends_with(']') {
+        &s[1..s.len() - 1]
+    } else {
+        s
+    }
+        .trim();
+
+    if inner.is_empty() {
+        return Vec::new();
+    }
+
+    let bytes = inner.as_bytes();
+    let mut i = 0usize;
+    let mut rows: Vec<Vec<String>> = Vec::new();
+    while i < bytes.len() {
+        // find next '['
+        while i < bytes.len() && bytes[i] != b'[' {
+            i += 1;
+        }
+        if i >= bytes.len() {
+            break;
+        }
+        let start = i + 1; // byte index after '['
+        i = start;
+        // find matching ']'
+        while i < bytes.len() && bytes[i] != b']' {
+            i += 1;
+        }
+        let end = i; // exclusive
+        // move i past ']' for next iteration (if in bounds)
+        if i < bytes.len() {
+            i += 1;
+        }
+
+        if end <= start {
+            // empty row like []
+            rows.push(Vec::new());
+            continue;
+        }
+
+        let row_str = &inner[start..end];
+        let row_vec: Vec<String> = row_str
+            .split(',')
+            .map(|x| {
+                let x = x.trim().trim_matches('"');
+                if x == "null" || x.is_empty() {
+                    "".to_string()
+                } else {
+                    x.to_string()
+                }
+            })
+            .collect();
+        rows.push(row_vec);
+    }
+
+    rows
 }

src/list.rs

@@ -0,0 +1,33 @@
+// Definition for singly-linked list.
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+  pub val: i32,
+  pub next: Option<Box<ListNode>>
+}
+
+impl ListNode {
+  #[inline]
+  fn new(val: i32) -> Self {
+    ListNode {
+      next: None,
+      val
+    }
+  }
+}
+
+pub fn make_list(arr: Vec<i32>) -> Option<Box<ListNode>> {
+    let mut head: Option<Box<ListNode>> = None;
+    let mut current = &mut head;
+
+    for &value in arr.iter() {
+        let new_node = Box::new(ListNode::new(value));
+        if current.is_none() {
+            *current = Some(new_node);
+        } else {
+            current.as_mut().unwrap().next = Some(new_node);
+            current = &mut current.as_mut().unwrap().next;
+        }
+    }
+
+    head
+}

src/main.rs

@@ -1,54 +1,29 @@
 mod arr;
 struct Solution {}
-
 impl Solution {
-    pub fn dfs(heights: &Vec<Vec<i32>>,arr: &mut Vec<Vec<bool>>,i:usize,j:usize ) {
-        let dirs = vec![(0,1),(0,-1),(1,0),(-1,0)];
-        for dir in dirs {
-            let (x,y) = (i as i32 + dir.0, j as i32 + dir.1);
-            if x>=0 && x<heights.len() as i32 && y>=0 && y<heights[0].len() as i32 && !arr[x as usize][y as usize] && heights[x as usize][y as usize]>=heights[i][j] {
-                arr[x as usize][y as usize] = true;
-                Self::dfs(heights,arr,x as usize,y as usize);
+    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;
+        }
+        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);
             }
         }
-    }
-    pub fn pacific_atlantic(heights: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
-        let (m,n) = (heights.len(),heights[0].len());
-        let mut pacific = vec![vec![false;n];m];
-        let mut atlantic = vec![vec![false;n];m];
-        let mut ans = vec![];
-        for i in 0..m {
-            pacific[i][0] = true;
-            atlantic[i][n-1] = true;
-            Self::dfs(&heights,&mut pacific,i,0);
-            Self::dfs(&heights,&mut atlantic,i,n-1);
-        }
-        for j in 0..n {
-            pacific[0][j] = true;
-            atlantic[m-1][j] = true;
-            Self::dfs(&heights,&mut pacific,0,j);
-            Self::dfs(&heights,&mut atlantic,m-1,j);
-        }
-        for i in 0..m {
-            for j in 0..n {
-                if pacific[i][j] && atlantic[i][j] {
-                    ans.push(vec![i as i32,j as i32]);
-                }
-            }
-        }
-        ans
+        dp[word1.len()][word2.len()]
     }
 }
-
 fn main() {
-    // [[1,2,2,3,5],[3,2,3,4,4],[2,4,5,3,1],[6,7,1,4,5],[5,1,1,2,4]]
-    // initial as a 2D vector
-    let arr = vec![
-        vec![1, 2, 2, 3, 5],
-        vec![3, 2, 3, 4, 4],
-        vec![2, 4, 5, 3, 1],
-        vec![6, 7, 1, 4, 5],
-        vec![5, 1, 1, 2, 4],
-    ];
-    println!("{:?}", Solution::pacific_atlantic(arr));
+    println!(
+        "{:?}",
+        Solution::min_distance("intention".to_string(), "execution".to_string())
+    );
 }