88. 合并两个有序数组 class Solution {
public:void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {int ii m - 1, jj n - 1, kk (mn) - 1;while(ii > 0 && jj > 0) {if(nums1[ii] > nums2[jj]) nums1[kk--] nums1…
1,题目要求 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 th…