Completed '283. Move Zeroes'

Author: OmnicWolf

Readme.md

@@ -4,7 +4,7 @@
 - Solutions Visualized – [@CoffeelessProgrammer | Instagram](https://www.instagram.com/coffeelessprogrammer/)
 
 ## Environment
-- <span>Rust v1.73.0</span>
+- <span>Rust v1.74.0</span>
 
 ## Problems Completed
 
@@ -18,6 +18,7 @@
 - **Arrays**
   - <span>27. Remove Element</span>
   - <span>88. Merge Sorted Array</span>
+  - <span>283. Move Zeroes</span>
 - **Strings**
   - <span>13. Roman to Integer</span>
   - <span>67. Add Binary</span>

src/array/mod.rs

@@ -1,5 +1,6 @@
 pub mod p0027_remove_element;
 pub mod p0088_merge_sorted_array;
+pub mod p0283_move_zeroes;
 
 pub fn run() {}
 

src/array/p0088_merge_sorted_array.rs

@@ -32,7 +32,7 @@ pub fn solve(nums1: &mut Vec<i32>, mut m: usize, nums2: Vec<i32>, mut n: usize)
 }
 
 #[cfg(test)]
-mod template_tests {
+mod merge_sorted_array_tests {
   use super::*;
 
   #[test]

src/array/p0283_move_zeroes.rs

@@ -0,0 +1,48 @@
+/*
+ * Problem: 283. Move Zeroes (Easy)
+ * URL: https://leetcode.com/problems/move-zeroes/
+ *
+ * Runtime: 7 ms (76.56%)
+ * Memory Usage: 2.16 MB (89.54%)
+ */
+
+
+pub fn solve(nums: &mut Vec<i32>) {
+  let mut next_zero = 0;
+  let mut len = nums.len();
+
+  for i in 0..len {
+    if(nums[i] != 0) {
+      nums[next_zero] = nums[i];
+      next_zero += 1;
+    }
+  }
+
+  for num in &mut nums[next_zero..len] {
+    *num = 0;
+  }
+
+  // for i in next_zero..nums.len() {
+  //     nums[i] = 0;
+  // }
+}
+
+
+#[cfg(test)]
+mod move_zeroes_tests {
+  use super::*;
+
+  #[test]
+  fn happy_path() {
+    let mut nums = vec![0,1,0,3,12];
+    solve(&mut nums);
+    assert!(nums == vec![1,3,12,0,0]);
+  }
+
+  #[test]
+  fn single_non_zero_element() {
+    let mut nums = vec![1];
+    solve(&mut nums);
+    assert_eq!(nums, vec![1]);
+  }
+}