basil2style · May 18, 2021 13:42
diff --git a/mergeSortedArrayWithThird.js b/mergeSortedArrayWithThird.js
 //Merge two sorted arrays into thrid array with O(n+m)
 var merge = function (nums1, m, nums2, n) {
  let i = 0,
    j = 0,
    k = 0;
  let arr = [];
  
  while (i < m && j < n) {
    if (nums1[i] < nums2[j]) {
      arr[k] = nums1[i];
      i = i+1;
    } else {
      arr[k] = nums2[j];
      j = j+1;
    }
    k++;
  }
  console.log("I: "+i+",J :"+j);
  while(i<m) {
    arr[k]= nums1[i];
    i++; k++;
  }

  console.log("I: "+i+",J :"+j);
  while(j<n) {
    arr[k]= nums2[j];
    j++; k++;
  }

  return arr;
 };

 let nums1 = [1, 2, 3, 0, 0, 0],
  m = 3,
  nums2 = [2, 5, 6],
  n = 3;
 // let nums1 = [1], m = 1, nums2 = [], n = 0;
 console.log(merge(nums1, m, nums2, n));
	//Merge two sorted arrays into thrid array with O(n+m)
	var merge = function (nums1, m, nums2, n) {
	let i = 0,
	j = 0,
	k = 0;
	let arr = [];

	while (i < m && j < n) {
	if (nums1[i] < nums2[j]) {
	arr[k] = nums1[i];
	i = i+1;
	} else {
	arr[k] = nums2[j];
	j = j+1;
	}
	k++;
	}
	console.log("I: "+i+",J :"+j);
	while(i<m) {
	arr[k]= nums1[i];
	i++; k++;
	}

	console.log("I: "+i+",J :"+j);
	while(j<n) {
	arr[k]= nums2[j];
	j++; k++;
	}

	return arr;
	};

	let nums1 = [1, 2, 3, 0, 0, 0],
	m = 3,
	nums2 = [2, 5, 6],
	n = 3;
	// let nums1 = [1], m = 1, nums2 = [], n = 0;
	console.log(merge(nums1, m, nums2, n));