leetcode 29-> Divide Two Integers without using multiplication, division and mod operator

class Solution(object):
    def divide(self, dividend, divisor):
        """
        :type dividend: int
        :type divisor: int
        :rtype: int
        """
        ispositive = True
        if dividend >  and divisor < :
            ispositive = False
        if dividend <  and divisor > :
            ispositive = False
        dividend = abs(dividend);divisor = abs(divisor)
        if dividend < divisor:
            return
        num = [,,,,,,,,,]
        i =
        newdividend = []
        while i >= :
            tmp =
            while dividend >= num[i]:
                tmp += ;dividend -= num[i]
            newdividend.append(tmp); i -=
        tmpm = ; ans =  ;i =
        while i < :
            while tmpm < divisor:
                if i > :
                    break
                j = ; t =
                while j <  and tmpm != :
                    t += tmpm; j +=
                tmpm = t + newdividend[i]; i +=
                if tmpm < divisor:
                    j = ; t =
                    while j <  and ans != :
                        t += ans; j +=
                    ans = t
            if tmpm >= divisor:
                k =
                while tmpm >= divisor:
                    tmpm -= divisor; k +=
                j = ; t =
                while j <  and ans != :
                    t += ans; j +=
                ans = t + k
        if ispositive:
            if ans > :
                return
            return ans
        if ans >= :
            return -
        return  - ans