My 0ms Java solution


  • 0
    L
    public class Solution {
        public void merge(int[] nums1, int m, int[] nums2, int n) {
            int i = m-1,j = n-1,k = m+n-1;
            while(j>=0){
                nums1[k--] = (i==-1|| nums2[j]>nums1[i])?nums2[j--]:nums1[i--];
            }
        }
    }
    

Log in to reply
 

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