Commit 5f25654

committed

feat(dsa): solve merge two sorted arrays using two pointers algorithm

1 parent f7f7d6e commit 5f25654Copy full SHA for 5f25654

File tree

+24

-1

lines changed

+24

-1

lines changed

Lines changed: 24 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -88,4 +88,27 @@ for (let i = 0; i < nums1.length - 1; i++) {`
`88`	`88`	`j1++;`
`89`	`89`	`}`
`90`	`90`	`}`
`91`		`-return j1;`
	`91`	`+console.log(j1);`
	`92`	`+`
	`93`	`+// Merge two sorted Arrays`
	`94`	`+let arr7 = [2, 5, 6];`
	`95`	`+let arr8 = [1, 3, 4, 8];`
	`96`	`+let merge = new Array(arr7.length + arr8.length);`
	`97`	`+let i = (j = k = 0);`
	`98`	`+`
	`99`	`+while (i < arr7.length && j < arr8.length) {`
	`100`	`+ if (arr7[i] < arr8[j]) {`
	`101`	`+ merge[k++] = arr7[i++];`
	`102`	`+ } else {`
	`103`	`+ merge[k++] = arr8[j++];`
	`104`	`+ }`
	`105`	`+}`
	`106`	`+`
	`107`	`+while (j < arr8.length) {`
	`108`	`+ merge[k++] = arr8[j++];`
	`109`	`+}`
	`110`	`+`
	`111`	`+while (i < arr7.length) {`
	`112`	`+ merge[k++] = arr7[i++];`
	`113`	`+}`
	`114`	`+console.log(merge);`

Comments

(0)