力扣：移动两个有序数组

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int point1 = m-1;
        int point2 = n-1;
        for (int i = m+n-1; i >= 0; i--){
            if(point1 < 0) nums1[i] = nums2[point2--];
            else if(point2 < 0) break;
            else if(nums1[point1] > nums2[point2]) {
                nums1[i] = nums1[point1];
                point1--;
            }
            else {
               nums1[i] = nums2[point2];
               point2--;
            }
        }
    }
};