Solved 0027

Author: guangsheng.li01

src/a0027_remove_element.rs

@@ -0,0 +1,46 @@
+/*
+ * [0027] remove-element
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
+        let mut i = 0;
+        while i < nums.len() {
+            if nums[i] == val {
+                nums.remove(i);
+            } else {
+                i += 1;
+            }
+        }
+        nums.len() as i32
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        let mut nums = vec![3, 2, 2, 3];
+        assert_eq!(Solution::remove_element(&mut nums, 2), 2);
+        assert_eq!(nums, vec![3, 3]);
+    }
+
+    #[test]
+    fn test_case1() {
+        let mut nums = vec![0, 1, 2, 2, 3, 0, 4, 2];
+        assert_eq!(Solution::remove_element(&mut nums, 2), 5);
+        assert_eq!(nums, vec![0, 1, 3, 0, 4]);
+    }
+}
+
+// solution tests ends here

src/lib.rs

@@ -8,6 +8,7 @@ mod a0001_two_sum;
 mod a0007_reverse_integer;
 mod a0009_palindrome_number;
 mod a0026_remove_duplicates_from_sorted_array;
+mod a0027_remove_element;
 mod a0145_binary_tree_postorder_traversal;
 mod a0172_factorial_trailing_zeroes;
 mod a0400_nth_digit;