1 line Solution


  • 0
    H
    public class Solution {
        public void Merge(int[] nums1, int m, int[] nums2, int n) {
            while(n >= 1)   nums1[m + n - 1] = m >= 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.