Changed Rust code to use more idiomatic iterator pattern.

levenshtein/rust/code.rs

@@ -27,30 +27,25 @@ fn levenshtein_distance(s1: &str, s2: &str) -> usize {
     };
 
     let m = s1_bytes.len();
-    let n = s2_bytes.len();
 
     // Use two rows instead of full matrix for space optimization
-    let mut prev_row = Vec::with_capacity(m + 1);
-    let mut curr_row = Vec::with_capacity(m + 1);
-
-    // Initialize first row
-    prev_row.extend(0..=m);
-    curr_row.resize(m + 1, 0);
-
+    let mut prev_row: Vec<usize> = (0..=m).collect();
+    let mut curr_row = vec![0; m+1];
+
     // Main computation loop
-    for j in 1..=n {
-        curr_row[0] = j;
+    for (j, b2) in s2_bytes.iter().enumerate() {
+        curr_row[0] = j+1;
 
-        for i in 1..=m {
-            let cost = if s1_bytes[i - 1] == s2_bytes[j - 1] { 0 } else { 1 };
+        for (i, b1) in s1_bytes.iter().enumerate() {
+            let cost = if b1 == b2 { 0 } else { 1 };
 
             // Calculate minimum of three operations
-            curr_row[i] = std::cmp::min(
+            curr_row[i+1] = std::cmp::min(
                 std::cmp::min(
-                    prev_row[i] + 1,      // deletion
-                    curr_row[i - 1] + 1,  // insertion
+                    prev_row[i+1] + 1,    // deletion
+                    curr_row[i] + 1,      // insertion
                 ),
-                prev_row[i - 1] + cost    // substitution
+                prev_row[i] + cost        // substitution
             );
         }
 
@@ -73,10 +68,10 @@ fn main() {
     let mut times = 0;
 
     // Compare all pairs of strings
-    for i in 0..args.len() {
-        for j in 0..args.len() {
+    for (i, arg1) in args.iter().enumerate() {
+        for (j, arg2) in args.iter().enumerate() {
             if i != j {
-                let distance = levenshtein_distance(&args[i], &args[j]);
+                let distance = levenshtein_distance(&arg1, &arg2);
                 if let Some(current_min) = min_distance {
                     if distance < current_min {
                         min_distance = Some(distance);