Class Sanghoo

LeetCode/Two Pointers/88. Merge Sorted Array/Sanghoo.java:8–20

https://leetcode.com/problems/merge-sorted-array/

 * https://leetcode.com/problems/merge-sorted-array/
 */
public class Sanghoo {

    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int index=0;

        for(int i=m; i<nums1.length; i++) {
            nums1[i] = nums2[index++];
        }

        Arrays.sort(nums1);
    }

}