-
Notifications
You must be signed in to change notification settings - Fork 0
/
Merge-sorted-Array.js
52 lines (52 loc) · 1.19 KB
/
Merge-sorted-Array.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
var merge = function(nums1, m, nums2, n) {
let i=0,j=0;
let result=[];
while(i<m && j<n){
//console.log(nums1[i] , nums2[j],i,j)
if(nums1[i] < nums2[j]){
result.push(nums1[i]);
i++;
}else if(nums1[i] == nums2[j]){
result.push(nums1[i]);
i++;
//j++;
}else{
result.push(nums2[j]);
j++;
}
//console.log(result)
}
if(j <n){
while(j<n){
result.push(nums2[j]);
j++
}
}else if(i <m){
while(i<m){
result.push(nums1[i]);
i++
}
}
//console.log(result)
//nums1=result;
for(let i=0;i<nums1.length;i++){
nums1[i] = result[i];
}
console.log(nums1)
};
merge([1,2,3,0,0,0],3,[2,5,6],3);
var mergeTwoPointer = function(nums1, m, nums2, n) {
let i=m-1,j=n-1,k=m+n-1;
// let result=[];
while(j >= 0){
if(i>=0 && nums1[i] > nums2[j]){
nums1[k--] = nums1[i];
i--;
}else{
nums1[k--] = nums2[j];
j--;
}
}
return nums1;
};
console.log(mergeTwoPointer([1,2,3,0,0,0],3,[2,5,6],3));