comefrom: <awangdev>349. Intersection of Two Arrays_2.java
code: private boolean binarySearch(int[] nums, int target) {
  
          int start = 0;
          int end = nums.length - 1;
          while(start <= end) {
              int mid = (start + end) / 2;
              if (nums[mid] < target) {
                  start = mid + 1;
              } else if (nums[mid] > target) {
                  end = mid - 1;
              } else {
                  return true;
              }
          }
          return false;
      }
masked: private boolean var_0 ( int [ ] var_1 , int var_2 ) {
    int var_3 = 0 ;
    int var_4 = var_1 . length - 1 ;
    while ( var_3 <= var_4 ) {
      int var_5 = ( var_3 + var_4 ) / 2 ;
      if ( var_1 [ var_5 ] < var_2 ) {
        var_3 = var_5 + 1 ;
      }
      else if ( var_1 [ var_5 ] > var_2 ) {
        var_4 = var_5 - 1 ;
      }
      else {
        return true ;
      }
    }
    return false ;
  }
  