Simple JAVA solution


  • 3
    J
    public class Solution {
        public void merge(int[] nums1, int m, int[] nums2, int n) {
            if (n==0)
            return;
            while (n>0){
                if(m==0){
                    nums1[m+n-1] = nums2[n-- -1];
                }
                else{
                    nums1[m+n-1] = (nums1[m-1]>nums2[n-1])? nums1[m-- -1]:nums2[n-- -1];
                }
            }
        }
    }

Log in to reply
 

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