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.
题目比较简单,由于num1的空间是足够的,O(n)时间内完成归并只要从后向前归并就可以了。
最近由于正好在看位操作符,判断m和n中有一个整数的判断语句一开始写成了(m&n) == 0,但是这是不对的。例如1 & 2的结果也是0。
代码如下,运行时间4ms:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int index(m + n - 1);
for(; index >= 0 && m != 0 && n != 0; --index) {
if(nums1[m - 1] >= nums2[n - 1]) {
nums1[index] = nums1[m - 1];
--m;
}
else {
nums1[index] = nums2[n - 1];
--n;
}
}
if(n != 0) {
for(int i = 0; i < n; ++i) {
nums1[i] = nums2[i];
}
}
}
};