@@ -0,0 +1,784 @@
+package MergeSortedArray;%0A%0A/**%0A * Given two sorted integer arrays nums1 and nums2,%0A * merge nums2 into nums1 as one sorted array.%0A * %3Cp%3E%0A * Note:%0A * You may assume that nums1 has enough space (size that is%0A * greater or equal to m + n) to hold additional elements%0A * from nums2. The number of elements initialized in nums1%0A * and nums2 are m and n respectively.%0A */%0Aclass Solution %7B%0A%0A    public void merge(int%5B%5D nums1, int m, int%5B%5D nums2, int n) %7B%0A        int i = m - 1, j = n - 1;%0A        int l = nums1.length - 1;%0A        while (i %3E= 0 && j %3E= 0) %7B%0A            if (nums1%5Bi%5D %3E nums2%5Bj%5D) %7B%0A                nums1%5Bl--%5D = nums1%5Bi--%5D;%0A            %7D else %7B%0A                nums1%5Bl--%5D = nums2%5Bj--%5D;%0A            %7D%0A        %7D%0A        while (j %3E= 0)%0A            nums1%5Bl--%5D = nums2%5Bj--%5D;%0A    %7D%0A%7D

Add Merge Sorted Array