@@ -0,0 +1,799 @@
+/**%0A * Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. %0A * Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to %0A * hold additional elements from nums2. The number of elements initialized in nums1 and nums2 %0A * are m and n respectively.%0A * @author Jun%0A *%0A */%0Apublic class Solution %7B%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, tail = m + n - 1;%0A        while(i %3E= 0 && j %3E= 0) %7B%0A            if(nums1%5Bi%5D %3E nums2%5Bj%5D)%0A                nums1%5Btail--%5D = nums1%5Bi--%5D;%0A            else%0A                nums1%5Btail--%5D = nums2%5Bj--%5D;%0A        %7D%0A        while(i %3E 0)%0A            nums1%5Btail--%5D = nums1%5Bi--%5D;%0A        while(j %3E 0)%0A            nums1%5Btail--%5D = nums2%5Bj--%5D;%0A    %7D%0A%7D%0A

Create 088.java