本文共 581 字,大约阅读时间需要 1 分钟。
class Solution(object): def divide(self, dividend, divisor): max_int = 2147483647 divd,divs = abs(dividend),abs(divisor) res = 0 while divd>=divs: a,i = divs,0 while a<=divd: a<<=1 i+=1 res += 1<<(i-1) divd -= (a>>1) if res >max_int:res = max_int if not ((dividend>0) ^ (divisor>0)) else max_int+1 return res if not ((dividend>0) ^ (divisor>0)) else -res
转载地址:http://pmrkn.baihongyu.com/