Skip to content

Commit

Permalink
Create 88-Merge-Sorted-Array.js
Browse files Browse the repository at this point in the history
Solved merge sorted Array in JS.
  • Loading branch information
aadil42 committed Dec 24, 2022
1 parent d16752c commit 5ffecfe
Showing 1 changed file with 35 additions and 0 deletions.
35 changes: 35 additions & 0 deletions javascript/88-Merge-Sorted-Array.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
/**
* Linear
* Time O(N) | Space O(1)
* https://leetcode.com/problems/merge-sorted-array/
* @param {number[]} nums1
* @param {number} m
* @param {number[]} nums2
* @param {number} n
* @return {void} Do not return anything, modify nums1 in-place instead.
*/
var merge = function(nums1, m, nums2, n) {

let k = m + n - 1;
m = m - 1;
n = n - 1;
console.log(m, n);
while (m >= 0 && n >= 0) {
if (nums1[m] > nums2[n]) {
nums1[k] = nums1[m];
m--;
} else {
nums1[k] = nums2[n];
n--;
}
k--;
}

if (n >= 0) {
while (n >= 0) {
nums1[k] = nums2[n];
n--;
k--;
}
}
};

0 comments on commit 5ffecfe

Please sign in to comment.