Find  First Bad Version in JavaScript (Leetcode Problem)

Problem

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.

Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.

You are given an API bool isBadVersion(version) which returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

Example 1:

Input: n = 5, bad = 4
Output: 4
Explanation:
call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true
Then 4 is the first bad version.

Example 2:

Input: n = 1, bad = 1
Output: 1

Solution

/**
 * Definition for isBadVersion()
 * 
 * @param {integer} version number
 * @return {boolean} whether the version is bad
 * isBadVersion = function(version) {
 *     ...
 * };
 */

/**
 * @param {function} isBadVersion()
 * @return {function}
 */
 
var solution = function(isBadVersion) {
    /**
     * @param {integer} n Total versions
     * @return {integer} The first bad version
     */
     function middle(n){
  let middle = 1;
  if(n>1){
    if(n%2){
    middle = (n-1)/2;
    }
    else{
      middle = n/2;
    }
  }
  return middle;
}
     function halfthenums(n){
    let res = [];
    if(n > 1){
        if(isBadVersion(middle(n))){
                res.push(1);
                res.push(middle(n));
            }
            else{
                res.push(middle(n));
                res.push(n);
            }
    }
    return res;
}
    return function(n) {
        if(n > 1){
        let halves = halfthenums(n);
        while((halves[0] - halves[0]) > 2){
            halves = halfthenums(halves[0]);
        }
        let starttingnumber = halves[0];
        let lastnumber = halves[1];
        let badversion = 0;
        for(let i = starttingnumber;i<=lastnumber; i++){
            if(isBadVersion(i)){
                badversion = i;
                break;
            }
        }
        return badversion;
    }
    else{
        if(isBadVersion(n)){
            return n;
        }
        return 0;
    }
    };
};