Skip to content

Files

Latest commit

0120d35 · Mar 14, 2018

History

History
This branch is up to date with aQuaYi/LeetCode-in-Go:master.

0088.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.

解题思路

见程序注释

总结