My c++ solution


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

Log in to reply
 

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