comefrom: <qiyuangong>004_Median_of_Two_Sorted_Arrays_1.py
code: def findMedianSortedArrays( nums1, nums2):
      p1 = p2 = 0
      ls1 = len(nums1)
      ls2 = len(nums2)
      all_nums = []
      median = 0.0
      while p1 < ls1 and p2 < ls2:
          if nums1[p1] < nums2[p2]:
              all_nums.append(nums1[p1])
              p1 += 1
          else:
              all_nums.append(nums2[p2])
              p2 += 1
      if p1 < ls1:
          while p1 < ls1:
              all_nums.append(nums1[p1])
              p1 += 1
      if p2 < ls2:
          while p2 < ls2:
              all_nums.append(nums2[p2])
              p2 += 1
      
      if (ls1 + ls2) % 2 == 1:
          median = all_nums[(ls1 + ls2) / 2]
      else:
          median = 1.0 * (all_nums[(ls1 + ls2) / 2] + all_nums[(ls1 + ls2) / 2 - 1]) / 2
      return median
masked: def sample_funcname ( var_0 , var_1 ) :
      var_4 = var_2 = 0
      var_6 = len ( var_0 )
      var_7 = len ( var_1 )
      var_8 = [ ]
      var_10 = 0.0
      while var_4 < var_6 and var_2 < var_7 :
          if var_0 [ var_4 ] < var_1 [ var_2 ] :
              var_8.append ( var_0 [ var_4 ] )
              var_4 += 1
          else :
              var_8.append ( var_1 [ var_2 ] )
              var_2 += 1
      if var_4 < var_6 :
          while var_4 < var_6 :
              var_8.append ( var_0 [ var_4 ] )
              var_4 += 1
      if var_2 < var_7 :
          while var_2 < var_7 :
              var_8.append ( var_1 [ var_2 ] )
              var_2 += 1
      if ( var_6 + var_7 ) % 2 == 1 :
          var_10 = var_8 [ ( var_6 + var_7 ) / 2 ]
      else :
          var_10 = 1.0 * ( var_8 [ ( var_6 + var_7 ) / 2 ] + var_8 [ ( var_6 + var_7 ) / 2 - 1 ] ) / 2
      return var_10
  