1. Merge 2 sorted list, until merged list reaches the length of the middle of sum length of 2 sorted arrays

  1. class Solution(object):
  2.     def findMedianSortedArrays(self, nums1, nums2):
  3.         """
  4.         :type nums1: List[int]
  5.         :type nums2: List[int]
  6.         :rtype: float
  7.         """
  8.         nl = len(nums1)
  9.         nr = len(nums2)
  10.         return self.findMergedMedian(nums1, nums2, nl, nr)
  14.     def findMergedMedian(self, L, R, L_n, R_n):
  15.         nums = []
  17.         m1 = m2 = 0
  19.         if((L_n + R_n) % 2 == 1):
  20.             m1 = (L_n + R_n) / 2
  21.             m2 = (L_n + R_n) / 2
  22.         elif((L_n + R_n) % 2 == 0):
  23.             m1 = ((L_n + R_n) / 2) - 1
  24.             m2 = (L_n + R_n) / 2
  26.         i_l = 0
  27.         i_r = 0
  29.       # * 1.0 is turning int into double
  31.         while(i_l < L_n and i_r < R_n):
  32.             if(L[i_l] < R[i_r]):
  33.                 nums.append(L[i_l])
  34.                 i_l += 1
  35.             else:
  36.                 nums.append(R[i_r])
  37.                 i_r += 1
  39.             if (i_l + i_r) > m2:
  40.                 return (nums[m1] + nums[m2]) * 1.0 / 2 
  42.         while(i_l < L_n):
  43.             nums.append(L[i_l])
  44.             i_l += 1
  46.             if((i_l + i_r) > m2):
  47.                 return (nums[m1] + nums[m2]) * 1.0 / 2
  49.         while(i_r < R_n):
  50.             nums.append(R[i_r]);
  51.             i_r += 1
  53.             if((i_l + i_r) > m2):
  54.                 return (nums[m1] + nums[m2]) * 1.0 / 2
  56.         return (nums[m1] + nums[m2]) * 1.0 / 2
  1. func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
  2.     ln := len(nums1)
  3.     rn := len(nums2)
  5.     return findMergedMedian(nums1, nums2, ln, rn)
  6. }
  8. func findMergedMedian(L []int, R[]int, L_n int, R_n int) float64 {
  9.     var nums []int
  11.     m1, m2, i_l, i_r := 0, 0, 0, 0
  13.     if(L_n + R_n)% 2 == 1 {
  14.         m1 = (L_n + R_n) / 2
  15.         m2 = (L_n + R_n) / 2
  16.     } else {
  17.         m1 = ((L_n + R_n) / 2) - 1
  18.         m2 = (L_n + R_n) / 2
  19.     }
  21.     for (i_l < L_n && i_r < R_n){
  22.         if(L[i_l] < R[i_r]){
  23.             nums = append(nums, L[i_l])
  24.             i_l++
  25.         } else {
  26.             nums = append(nums, R[i_r])
  27.             i_r++
  28.         }
  30.         if(i_l + i_r) > m2{
  31.             return float64(nums[m1] + nums[m2]) / 2
  32.         }
  33.     }
  35.     for (i_l < L_n){
  36.         nums = append(nums, L[i_l])
  37.         i_l++
  39.         if(i_l + i_r) > m2{
  40.             return float64(nums[m1] + nums[m2]) / 2
  41.         }
  42.     }
  44.     for (i_r < R_n){
  45.         nums = append(nums, R[i_r])
  46.         i_r++
  48.         if(i_l + i_r) > m2{
  49.             return float64(nums[m1] + nums[m2]) / 2
  50.         }
  51.     }
  54.     return float64(nums[m1] + nums[m2]) / 2
  55. }