[LeetCode]88. Merge Sorted Array ★

题目描述

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

The number of elements initialized in nums1 and nums2 are m and n respectively.
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
题目大意：将两个排好序的数组合并成一个

样例

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]

python解法

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        for i, val in enumerate(nums2):
            if val >= nums1[m+i-1]:
                nums1.insert(m+i, val)
                nums1.pop()
                continue
            for index, value in enumerate(nums1):
                if val < value:
                    nums1.insert(index, val)
                    nums1.pop()
                    break

Runtime: 48 ms, faster than 34.70% of Python3 online submissions for Merge Sorted Array.
Memory Usage: 13.6 MB, less than 6.15% of Python3 online submissions for Merge Sorted Array.
题后反思：

1. 使用python实现的insert方法进行插入，但是要注意去掉nums1中多出来的0

C语言解法

void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n){
    for (int i=0;i<n;i++)
    {
        int j;
        for (j = m+i-1;j>=0;j--)
        {
            if (nums2[i]<nums1[j])
                nums1[j+1] = nums1[j];
            else 
                break;
        }
        nums1[j+1] = nums2[i];
    }
}

Runtime: 4 ms, faster than 80.17% of C online submissions for Merge Sorted Array.
Memory Usage: 7.3 MB, less than 66.67% of C online submissions for Merge Sorted Array.
题后反思：

1. 用到的插入排序的思想，要比插入排序还要简单一些。
2. nums1Size和nums2Size没有用处。
   文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步