Completed 'Merge Sorted Array'

Author: OmnicWolf

Readme.md

@@ -17,6 +17,7 @@
   - <span>191. Number of 1 Bits</span>
 - **Arrays**
   - <span>27. Remove Element</span>
+  - <span>88. Merge Sorted Array</span>
 - **Strings**
   - <span>13. Roman to Integer</span>
   - <span>67. Add Binary</span>

src/array/mod.rs

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

src/array/p0088_merge_sorted_array.rs

@@ -0,0 +1,75 @@
+/*
+ * Problem: 88. Merge Sorted Array (Easy)
+ * URL: https://leetcode.com/problems/merge-sorted-array/
+ *
+ * Runtime: 0 ms (100%)
+ * Memory Usage: 2.02 MB (67.99%)
+ */
+
+pub fn solve(nums1: &mut Vec<i32>, mut m: usize, nums2: Vec<i32>, mut n: usize) {
+  // let mut pos: usize = (m+n).try_into().unwrap(); // Uses more memory
+
+  let mut pos = (m+n) as usize; // insert_position
+  
+  while n>0 {
+    if m>0 && nums1[m-1] > nums2[n-1]   {
+      nums1[pos-1] = nums1[m-1];
+      m -= 1;
+    } else {
+      nums1[pos-1] = nums2[n-1];
+      n -= 1;
+    }
+
+    pos -= 1;
+  }
+
+  // Consume remaining nums2 elements
+  // while n>0 {
+  //   nums1[pos-1] = nums2[n-1];
+  //   n -= 1;
+  //   pos -= 1;
+  // }
+}
+
+#[cfg(test)]
+mod template_tests {
+  use super::*;
+
+  #[test]
+  fn happy_path() {
+    let mut arr = vec![1,2,3,0,0,0];
+
+    solve(&mut arr, 3, vec![2,5,6], 3);
+
+    assert_eq!(arr, vec![1,2,2,3,5,6]);
+  }
+
+  #[test]
+  fn nums1_greater_than_nums2() {
+    let mut arr = vec![4,5,6,0,0,0];
+
+    solve(&mut arr, 3, vec![1,2,3], 3);
+
+    assert_eq!(arr, vec![1,2,3,4,5,6]);
+  }
+
+  #[test]
+  fn no_elements_nums1() {
+    let mut arr = vec![0];
+
+    solve(&mut arr, 0, vec![1], 1);
+
+    assert_eq!(arr, vec![1]);
+  }
+
+  #[test]
+  fn no_elements_nums2() {
+    let mut arr = vec![1,2];
+
+    solve(&mut arr, 2, vec![], 0);
+
+    assert_eq!(arr, vec![1,2]);
+  }
+}
+
+//