comefrom: <awangdev>Median of two Sorted Arrays_1.java
code: private int findKth(int[] numsA, int startA, int[] numsB, int startB, int k) {
  
          if (startA >= numsA.length) return numsB[startB + k - 1]; 
          if (startB >= numsB.length) return numsA[startA + k - 1]; 
  
          if (k == 1) return Math.min(numsA[startA], numsB[startB]);
  
          int halfKthOfA = startA + k / 2 - 1 < numsA.length ? numsA[startA + k / 2 - 1] : Integer.MAX_VALUE;
          int halfKthOfB = startB + k / 2 - 1 < numsB.length ? numsB[startB + k / 2 - 1] : Integer.MAX_VALUE;
          if (halfKthOfA < halfKthOfB) {
              return findKth(numsA, startA + k / 2, numsB, startB, k - k / 2);
          } else {
              return findKth(numsA, startA, numsB, startB + k / 2, k - k / 2);
          }
      }
masked: private int sample_funcname ( int [ ] numsA , int startA , int [ ] numsB , int startB , int k ) {
    if ( startA >= numsA . length ) return numsB [ startB + k - 1 ] ;
    if ( startB >= numsB . length ) return numsA [ startA + k - 1 ] ;
    if ( k == 1 ) return Math . min ( numsA [ startA ] , numsB [ startB ] ) ;
    int halfKthOfA = startA + k / 2 - 1 < numsA . length ? numsA [ startA + k / 2 - 1 ] : Integer . MAX_VALUE ;
    int halfKthOfB = startB + k / 2 - 1 < numsB . length ? numsB [ startB + k / 2 - 1 ] : Integer . MAX_VALUE ;
    if ( halfKthOfA < halfKthOfB ) {
      return findKth ( numsA , startA + k / 2 , numsB , startB , k - k / 2 ) ;
    }
    else {
      return findKth ( numsA , startA , numsB , startB + k / 2 , k - k / 2 ) ;
    }
  }
  