Merge pull request neetcode-gh#1562 from supremvanam/main

Create: 88-Merge-Sorted-Array.java
Gyanachand1 · Dec 22, 2022 · 0a318a2 · 0a318a2
2 parents 8954592 + 83f9143
commit 0a318a2
Showing 1 changed file with 19 additions and 0 deletions.
diff --git a/java/88-Merge-Sorted-Array.java b/java/88-Merge-Sorted-Array.java
@@ -0,0 +1,19 @@
+class Solution {
+
+ // Time: O(m+n) | Space: O(1)
+ public void merge(int[] nums1, int m, int[] nums2, int n) {
+ // Three pointer technique
+ int r1 = m-1;
+ int r2 = n-1;
+
+ for(int w = m+n-1; w >= 0; w--) {
+ if(r1 >= 0 && r2 >= 0) {
+ nums1[w] = nums1[r1] > nums2[r2] ? nums1[r1--] : nums2[r2--];
+ } else if (r1 >= 0) {
+ nums1[w] = nums1[r1--];
+ } else {
+ nums1[w] = nums2[r2--];
+ }
+ }
+ }
+}