【LeetCode】88. 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.

思路

1. 将nums2添加到nums1上
2. 从第m个数起进行插入排序操作

代码

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        for(int i=m,j=0;i<nums1.size()&&j<n;i++,j++) {
            nums1[i] = nums2[j];
        }
        int a = m+n;
        for(int i=m;i<a;i++) {
            int tmp = nums1[i];
            int j=i-1;
            for(;j>=0;j--) {
                if(nums1[j]>tmp) {
                    nums1[j+1] = nums1[j];
                } else {
                    break;
                }
            }
            nums1[j+1] = tmp;
        }
    }
};