human
I found an interesting problem on https://leetcode.com/problems/divide-two-integers/:
Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.

Return the quotient after dividing dividend by divisor.

The integer division should truncate toward zero.

Example 1:

Input: dividend = 10, divisor = 3
Output: 3

Example 2:

Input: dividend = 7, divisor = -3
Output: -2

Note:

       Both dividend and divisor will be 32-bit signed integers.
       The divisor will never be 0.
       Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 231 − 1 when the division result overflows.

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
     def divide(self, dividend, divisor):
         """
         :type dividend: int
         :type divisor: int
         :rtype: int
         """
         MIN_INT = -2**31
         MAX_INT = -MIN_INT - 1
         if divisor == 0 or (dividend == MIN_INT and divisor==-1):
             return MAX_INT
         sign = 1
         if dividend < 0:
             sign = -sign
             dividend = -dividend
         if divisor < 0:
             sign = -sign
             divisor = -divisor
         ans = bits = 0
         while (divisor<<(bits+1)) <= dividend:
             bits += 1
         while bits >= 0:
             if dividend >= (divisor<<bits):
                 dividend -= (divisor<<bits)
                 ans += (1<<bits)
             bits -= 1
         return ans if sign==1 else -ans