題目簡介
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.
Tags : Array, Two Pointers
思路:
將向量nums2中的元素增加到nums1,長度固定,根據兩個向量的指針插入元素;
我還自以爲是地寫下被註釋那行,錯誤!!!
因爲前面有個i>==0,要與其保持邏輯的一致性。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for(int i=m-1, j=n-1, k = m+n-1;j>=0;){
//nums1[k--] = i>=0 && nums1[i]<=nums2[j]? nums2[j--]:nums1[i--];
nums1[k--] = i>=0 && nums1[i]>nums2[j]? nums1[i--]:nums2[j--];
}
}
};