LeetCode@Array_88_MergeSortedArray

Problem Discription

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.

Java Programming

public class Solution
{
public void merge(int[] nums1, int m, int[] nums2, int n)
{
int p1 = m - 1;
int p2 = n - 1;
int curr = m + n - 1;
while (p1 > -1 && p2 > -1)
{
nums1[curr--] = nums1[p1] > nums2[p2] ? nums1[p1--] : nums2[p2--];
}
while (p2 > -1)
{
nums1[curr--] = nums2[p2--];
}
}

}

Similar Link: