comefrom: <qiyuangong>350_Intersection_of_Two_Arrays_II_1.py
code: def intersect( nums1, nums2):
      nums1.sort()
      nums2.sort()
      res = []
      pos1 = pos2 = 0
      while pos1 < len(nums1) and pos2 < len(nums2):
          if nums1[pos1] == nums2[pos2]:
              res.append(nums1[pos1])
              pos1 += 1
              pos2 += 1
          elif nums1[pos1] < nums2[pos2]:
              pos1 += 1
          else:
              pos2 += 1
      return res
masked: def sample_funcname ( var_0 , var_1 ) :
      var_0.sort ( )
      var_1.sort ( )
      var_3 = [ ]
      var_6 = var_4 = 0
      while var_6 < len ( var_0 ) and var_4 < len ( var_1 ) :
          if var_0 [ var_6 ] == var_1 [ var_4 ] :
              var_3.append ( var_0 [ var_6 ] )
              var_6 += 1
              var_4 += 1
          elif var_0 [ var_6 ] < var_1 [ var_4 ] :
              var_6 += 1
          else :
              var_4 += 1
      return var_3
  