88. Merge Sorted Array

发表于 | 分类于 ， | 阅读次数:

Total Accepted: 88608
Total Submissions: 297379
Difficulty: Easy

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:

1
2
3
4
5
6
7
8
9
public class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int k = m-- + n-- - 1;
        while (m >= 0 && n >= 0)
            nums1[k--] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];
        while (n >= 0)
            nums1[k--] = nums2[n--];
    }
}

打个小广告

欢迎加入我的小专栏「基你太美」一起学习。