solve(1848): implement solution with iterator

Author: kallydev

src/solutions/_1848_minimum_distance_to_the_target_element.rs

@@ -0,0 +1,26 @@
+use crate::solutions::Solution;
+
+impl Solution {
+    pub fn get_min_distance(nums: Vec<i32>, target: i32, start: i32) -> i32 {
+        let mut min_distance = nums.len() as i32;
+
+        for (i, &num) in nums.iter().enumerate() {
+            if num == target {
+                min_distance = min_distance.min((i as i32 - start).abs())
+            }
+        }
+
+        min_distance
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::get_min_distance(vec![1, 2, 3, 4, 5], 5, 3), 1);
+    assert_eq!(Solution::get_min_distance(vec![1], 1, 0), 0);
+    assert_eq!(
+        Solution::get_min_distance(vec![1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 1, 1),
+        0
+    );
+    assert_eq!(Solution::get_min_distance(vec![5, 3, 6], 5, 2), 2);
+}

src/solutions/mod.rs

@@ -3,6 +3,7 @@ pub mod _0009_palindrome_number;
 pub mod _0020_valid_parentheses;
 pub mod _0026_remove_duplicates_from_sorted_array;
 pub mod _0027_remove_element;
+pub mod _1848_minimum_distance_to_the_target_element;
 pub mod _3046_split_the_array;
 
 pub struct Solution {}