Leetcode 29 Divide Two Integers

class Solution:
    # @param {integer} dividend
    # @param {integer} divisor
    # @return {integer}
    def divide(self, dividend, divisor):
        if(dividend < 0 and divisor > 0) or (dividend > 0 and divisor < 0): flag=1
        else: flag=0
        a=abs(dividend);b=abs(divisor)
        result=0;c=0
        while a>=b:
            i=0;c=b
            while a>=c:
                a -= c
                result += (1<<i)
                i += 1
                c = (c<<i)
        if flag: result = -result
        return min(max(-2147483648, result), 2147483647)

代码有问题，不要参考……不好意思，浪费您的时间了！