#88. Merge Sorted Array 
 
"""
Given two sorted integer arrays nums1 and nums2, 
merge nums2 into nums1 as one sorted array.

Note:
 You may assume that nums1 has enough space 
 (size that is greater or equal to m + n) 
 to hold additional elements from nums2. 
 The number of elements initialized in nums1 and nums2 are m and n respectively.
"""

#Array, Two Pointers 


class Solution(object):
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: List[int]
        :type m: int
        :type nums2: List[int]
        :type n: int
        :rtype: void Do not return anything, modify nums1 in-place instead.
        """
        
        for i in range(n):
            nums1[i+m]=nums2[i]
        nums1.sort()

        
        
        
#Work on a better method here 
class Solution(object):
    def merge(self, nums1, m, nums2, n):
        indexA = m-1;
        indexB = n-1;
        while indexA >=0 and indexB>=0:
            if nums1[indexA] > nums2[indexB]:
                nums1[indexA+indexB+1] = nums1[indexA]
                indexA -= 1
            else:
                nums1[indexA+indexB+1] = nums2[indexB]
                indexB -= 1
        while indexB >= 0:
             nums1[indexB] = nums2[indexB]
             indexB -= 1
