【朱迪的LeetCode刷题笔记】88. Merge Sorted Array #Easy #C

Judie

1. 
   
2. 88. Merge Sorted Array #Easy
   
3. 
   
4. Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
   
5. 
   
6. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2.
   
7. 
   
8. 
   
9. Example 1:
   
10. 
    
11. Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
    
12. Output: [1,2,2,3,5,6]
    
13. 
    
14. Example 2:
    
15. 
    
16. Input: nums1 = [1], m = 1, nums2 = [], n = 0
    
17. Output: [1]
    
18. 
    
19. 
    
20. Constraints:
    
21. 
    
22. nums1.length == m + n
    
23. nums2.length == n
    
24. 0 <= m, n <= 200
    
25. 1 <= m + n <= 200
    
26. -109 <= nums1[i], nums2[i] <= 109
    

复制代码