merge sorted array

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.

Solution

public class  {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int index = m+n-1;
        m--;n--;
        while(m>=0&&n>=0) {
            if(nums1[m] > nums2[n]) {
                nums1[index--] = nums1[m--];
            } else {
                nums1[index--] = nums2[n--];
            }
        }
        while(n>=0) {
            nums1[index--] = nums2[n--];
        }
    }
}

merge sorted array

近期文章

近期评论

标签

热门

文章归档

分类目录

功能