FilesExpand file tree

 master

/

Merge Sorted Array.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

16 lines (14 loc) · 677 Bytes

 master

/

Merge Sorted Array.js

Copy path

Top

File metadata and controls

• Code
• Blame

16 lines (14 loc) · 677 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

/*Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.*/

/**

* @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) {

for (i = m - 1, j = n - 1, k = m + n - 1; k >= 0 && j >= 0; k--)

nums1[k] = (i < 0 || nums1[i] < nums2[j]) ? nums2[j--] : nums1[i--];

};