Create merge-sorted-array.cpp

Author: kamyu104

C++/merge-sorted-array.cpp

@@ -0,0 +1,25 @@
+// Time:  O(n)
+// Space: O(1)
+
+class Solution {
+public:
+    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
+        int i = m + n;
+        while (m > 0 && n > 0) {
+            if (nums1[m - 1] > nums2[n - 1]) {
+                nums1[i - 1] = nums1[m - 1];
+                --m;
+            } else {
+                nums1[i - 1] = nums2[n - 1];
+                --n;
+            }
+            --i;
+        }
+
+        while (n > 0) {
+            nums1[i - 1] = nums2[n - 1];
+            --n;
+            --i;
+        }
+    }
+};