Leetcode习题：Divide Two Integers

Divide Two Integers

 

AC Rate: 770/5289

My Submissions

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

提交了几次，看似简单的一道题，第一下提交发现忘考虑负数的情况……以后做题一定要想清楚。第二次提交最简单的做法，结果会超时。下面是一个logn的算法，每次将被除数翻倍，这样加快计算的速度。

    public int divide(int dividend, int divisor) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(divisor == 0 || dividend == 0){
            return 0;
        }
        
        boolean negative = (dividend<0) ^ (divisor<0);
        
        long a = abs(dividend);
        long b = abs(divisor);
        
        int finalCount = 0;
        int count = 0;
        
        while(a>=b){
          count = 1;
          b = abs(divisor);
          long sum = b;
          while(sum+sum <= a){
              sum += sum;
              count += count;
          }
          a -= sum;
          finalCount += count;
        };
        
        if(negative){
            return 0 - finalCount;
        }else{
            return finalCount;
        }
    }
    
    private long abs(int num){
        if(num < 0){
            return -(long)num;
        }
        return (long)num;
    }