88-Merge Sorted Array

来源:互联网 发布:中国地名数据库下载 编辑:程序博客网 时间:2024/05/21 06:31
题目

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.

分析

从后向前比较

//在当测试用例是[0],0,[1],1 时,会输出错误的结果········while(l1>=0&&l2>=0)    nums1[l--] = nums1[l1] > nums2[l2] ? nums1[l1--] : nums2[l2--];
实现
class Solution {public:    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {        int l = m + n-1, l1 = m-1 , l2 = n-1 ;        while (l2 >= 0)            nums1[l--] = l1 >= 0 && nums1[l1] > nums2[l2] ? nums1[l1--] : nums2[l2--];    }};
原创粉丝点击