comefrom: <qiyuangong>004_Median_of_Two_Sorted_Arrays_1.java
code: public double findMedianSortedArrays(int[] nums1, int[] nums2) {
      	int p1 = 0, p2 = 0, pos = 0;
      	int ls1 = nums1.length, ls2 = nums2.length;
      	int[] all_nums = new int[ls1+ls2];
      	double median = 0.0;
      	while (p1 < ls1 && p2 < ls2){
      		if (nums1[p1] <= nums2[p2])
      			all_nums[pos++] = nums1[p1++];
      		else
      			all_nums[pos++] = nums2[p2++];
      	}
      	while (p1 < ls1)
      		all_nums[pos++] = nums1[p1++];
      	while (p2 < ls2)
      		all_nums[pos++] = nums2[p2++];
      	if ((ls1 + ls2) % 2 == 1)
      		median = all_nums[(ls1 + ls2) / 2];
      	else
      		median = (all_nums[(ls1 + ls2) / 2] + all_nums[(ls1 + ls2) / 2 - 1]) / 2.0;
          return median;
      }
masked: public double sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
    int var_3 = 0 , var_4 = 0 , var_5 = 0 ;
    int var_7 = var_0 . length , var_8 = var_1 . length ;
    int [ ] var_9 = new int [ var_7 + var_8 ] ;
    double var_11 = 0.0 ;
    while ( var_3 < var_7 && var_4 < var_8 ) {
      if ( var_0 [ var_3 ] <= var_1 [ var_4 ] ) var_9 [ var_5 ++ ] = var_0 [ var_3 ++ ] ;
      else var_9 [ var_5 ++ ] = var_1 [ var_4 ++ ] ;
    }
    while ( var_3 < var_7 ) var_9 [ var_5 ++ ] = var_0 [ var_3 ++ ] ;
    while ( var_4 < var_8 ) var_9 [ var_5 ++ ] = var_1 [ var_4 ++ ] ;
    if ( ( var_7 + var_8 ) % 2 == 1 ) var_11 = var_9 [ ( var_7 + var_8 ) / 2 ] ;
    else var_11 = ( var_9 [ ( var_7 + var_8 ) / 2 ] + var_9 [ ( var_7 + var_8 ) / 2 - 1 ] ) / 2.0 ;
    return var_11 ;
  }
  