Code-Challenges/mergeSortedArray.js at master · javiermatias/Code-Challenges · GitHub

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
53
54
55
56
57
58
59
60
var merge = function(nums1, m, nums2, n) {

    let largo=m+n;
    for(let i=0; i<largo; i++){
      if(m > 0){
        if(nums1[i] >= nums2[0]){
            let element=nums2.shift();
            nums1.pop();
            nums1.splice(i,0,element);
            //i++;
        }
        m--;
      }else{
        let element=nums2.shift();
        nums1[i]=element;

      }


  }


    /*     let count=0;
    if(!n) return nums1;
    if(!m){
        nums1.push(...nums2);
    }
    //let total=m+n;
    let largeM=m;
    let largeN=n


    while(m && n){

        if(nums1[largeM-m] >= nums2[largeN-n]){
            let element=nums2.shift();
            nums1.splice(largeM-m,0,element);
            n--;
            m--;
        }else{
            m--;
        }

    }
    if(n){
        nums1.push(...nums2);
    }
    return nums1; */
};


let arr=[4,5,6,0,0,0];
let m=3
let arr2=[1,2,3];
n=3;

merge(arr,m,arr2,n);[4,5,6,0,0,0]