Add Merge Sorted Array

Author: gahogg

Merge Sorted Array - Leetcode 88/Merge Sorted Array - Leetcode 88.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
+        int x = m - 1, y = n - 1;
+
+        for (int z = m + n - 1; z >= 0; z--) {
+            if (x < 0) {
+                nums1[z] = nums2[y--];
+            } else if (y < 0) {
+                break;
+            } else if (nums1[x] > nums2[y]) {
+                nums1[z] = nums1[x--];
+            } else {
+                nums1[z] = nums2[y--];
+            }
+        }
+    }
+};

Merge Sorted Array - Leetcode 88/Merge Sorted Array - Leetcode 88.java

@@ -0,0 +1,17 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int x = m - 1, y = n - 1;
+
+        for (int z = m + n - 1; z >= 0; z--) {
+            if (x < 0) {
+                nums1[z] = nums2[y--];
+            } else if (y < 0) {
+                break;
+            } else if (nums1[x] > nums2[y]) {
+                nums1[z] = nums1[x--];
+            } else {
+                nums1[z] = nums2[y--];
+            }
+        }
+    }
+}

Merge Sorted Array - Leetcode 88/Merge Sorted Array - Leetcode 88.js

@@ -0,0 +1,15 @@
+var merge = function(nums1, m, nums2, n) {
+    let x = m - 1, y = n - 1;
+
+    for (let z = m + n - 1; z >= 0; z--) {
+        if (x < 0) {
+            nums1[z] = nums2[y--];
+        } else if (y < 0) {
+            break;
+        } else if (nums1[x] > nums2[y]) {
+            nums1[z] = nums1[x--];
+        } else {
+            nums1[z] = nums2[y--];
+        }
+    }
+};

Merge Sorted Array - Leetcode 88/Merge Sorted Array - Leetcode 88.py

@@ -0,0 +1,22 @@
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        x, y = m-1, n-1
+
+        for z in range(m + n - 1, -1, -1):
+            if x < 0:
+                nums1[z] = nums2[y]
+                y -= 1
+            elif y < 0:
+                break
+            elif nums1[x] > nums2[y]:
+                nums1[z] = nums1[x]
+                x -= 1
+            else:
+                nums1[z] = nums2[y]
+                y -= 1
+        
+        # Time: O(n + m)
+        # Space: O(1)