Leetcode:merge Sorted Array

Merge Sorted Array
Total Accepted: 99440 Total Submissions: 330510 Difficulty: Easy

Given sorted integer Arrays nums1 and nums2, merge nums2 into nums1 as one sorted Array.

Note:
Assume that nums1 have enough space (size that's greater or equal to m + n) to hold add Itional elements from nums2. The number of elements initialized in nums1 and nums2 is m and n respectively.

Subscribe to see which companies asked this question

Hide TagsArray of PointersHide Similar Problems(E) Merge Sorted Lists

C + + code:

Class Solution {public:    void merge (vector<int>& nums1, int m, vector<int>& nums2, int n) {        if (0 = = n) return;    if (0 = = m) for    (int i = 0; i<n; i++) nums1[i] = Nums2[i];    int k = m + n-1;    int i = m-1, j = n-1;    while (i>=0 && j>=0)    {    if (Nums1[i]>nums2[j]) nums1[k--] = nums1[i--];    else nums1[k--] = nums2[j--];    }    while (J >= 0) nums1[k--] = nums2[j--];    }};

Leetcode:merge Sorted Array