leetcode:Merge Sorted Array 5行代码AC

class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int indexNum1 = m - 1, indexNum2 = n - 1, index = m + n - 1;
while (indexNum1 >= 0 && indexNum2 >= 0)
nums1[index --] = nums1[indexNum1] >= nums2[indexNum2] : nums1[indexNum1--] ? nums2[indexNum2--];
if (indexNum2 >= 0)
copy(nums2.begin(), nums2.begin() + indexNum2 + 1, nums1.begin());
// copy(nums1.begin(), nums1.begin() + m + n, ostream_iterator<int>(cout, " "));
}
};