88.Merge Sorted Array¶
Tags: Easy
Array
Two Pointers
Links: https://leetcode.com/problems/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]
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<int> tmp(m + n);
int cnt = 0;
int pos1 = 0, pos2 = 0;
while (pos1 < m && pos2 < n) {
if (nums1[pos1] <= nums2[pos2]) {
tmp[cnt++] = nums1[pos1++];
}
else {
tmp[cnt++] = nums2[pos2++];
}
}
while (pos1 < m) tmp[cnt++] = nums1[pos1++];
while (pos2 < n) tmp[cnt++] = nums2[pos2++];
nums1 = tmp;
}
};
相当于归并排序中的一部分。