Perfect and easy 0ms Java solution

  • 2
    public class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
      int i =m-1;
      int j=n-1;
      int k=m+n-1;
      while(i>=0 && j>=0){
          nums1[k--] = (nums1[i]>nums2[j]) ? nums1[i--]:nums2[j--];   //whichever is greater is copied at the end
          nums1[k--] = nums2[j--];   //rest of the second array is copied at last 

Log in to reply

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