[leetcode]88. Merge Sorted Array

[leetcode]88. Merge Sorted Array

---

Analysis

刷题and学英语and学算法—— [坚持吖~]

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
这道题比较简单，就是把两个排好序的数组合并一下。

Implement

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        vector<int> res;
        int i = 0;
        int j = 0;
        while(i < m && j <n){
            if(nums1[i] < nums2[j]){
                res.push_back(nums1[i]);
                i++;
            }
            if(nums2[j] < nums1[i]){
                res.push_back(nums2[j]);
                j++;
            }
            if(nums1[i] == nums2[j]){
                res.push_back(nums1[i]);
                res.push_back(nums2[j]);
                i++;
                j++;
            }
        }
        while(i<m){
            res.push_back(nums1[i]);
            i++;
        }
        while(j<n){
            res.push_back(nums2[j]);
            j++;
        }
        nums1 = res;
    }
};