Java one-liner


  • 0
    V

    Not very understandable, but interesting.

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

Log in to reply
 

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