1 ms solution


  • 0
    T

    class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
    int toFill = m+n -1;
    m--;n--;
    while(m>=0 && n>=0){
    nums1[toFill--] = (nums1[m]>nums2[n])?nums1[m--]:nums2[n--];
    }
    while(n>=0){
    nums1[toFill--]=nums2[n--];
    }
    }
    }


Log in to reply
 

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