My c++ solution


  • 1
    M
    class Solution {
    public:
        void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
            while(m >= 0  && n > 0) {
                if(m == 0 || nums1[m - 1] < nums2[n - 1]) {
                    nums1[m + n - 1] = nums2[n - 1];
                    n--;
                }
                else {
                    nums1[m + n - 1] = nums1[m - 1];
                    m--;
                }
            }
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.