[LeetCode] Divide Two Integers( bit + 二分法 )

Divide two integers without using multiplication, division and mod operator.

常常出现大的负数，无法用abs()转换成正数的情况

class Solution{
private:
    vector<long long> f;
public:
    int bsearch(vector<long long> &a,int left,int right,long long key){
        if(left > right)
            return -;

        int mid = left + (right-left)/;
        if(a[mid]==key)
            return mid;
        else if(a[mid]<key){
           int pos = bsearch(a,mid+,right,key);
           return pos == - ?mid :pos;
        }else
            return bsearch(a,left,mid-,key);
    }

    int divide(int devidend,int divisor){
        int sign = devidend < ?-:;
        if(divisor<)
            sign *= -;

        long long div = devidend;
        div = abs(div);
        long long divisorL = divisor;
        divisorL = abs(divisorL);
        f.push_back(divisorL);
        int size = ;

        while(true){
            if(f[size-] >= div)
                break;
            f.push_back(f[size-]+f[size-]);
            size++;
        }//end while

        int num = ;
        long long sum = ;
        while(div>){
           int pos = bsearch(f,,size-,div);
           if(pos == -)
               break;
           div -= f[pos];
           num += (<< pos);
        }//end while
       return num*sign;
    }
};