leetcode [#88]

目录

• 1. 题目
• 2. 解决方案
• 3. 注意事项

题目

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.

---

解决方案

public class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int[] result = new int[m + n];
        int index = 0;

        int len1 = nums1.length;
        int len2 = nums2.length;

        int p = 0;
        int q = 0;
        while(p < m || q < n){
            if(p < m && q < n){
                if(nums1[p] <= nums2[q]){
                    result[index++] = nums1[p];
                    p++;
                } else {
                    result[index++] = nums2[q];
                    q++;
                }
            } else if(p == m && q < n){
                result[index++] = nums2[q];
                q++;
            } else {
                result[index++] = nums1[p];
                p++;
            }
        }
        for(int s = 0; s < result.length; s++){
            nums1[s] = result[s];
        }
    }
}

---

注意事项

1. 默认升序排序。
2. 借鉴归并排序的方法进行排序。