목록29. Divide Two Integers (1)

Scribbling

LeetCode: 29. Divide Two Integers

* Note: shift left is the same as multiplying by two. class Solution: def divide(self, dividend: int, divisor: int) -> int: # Overflow if dividend == -2**31 and divisor == -1: return 2**31 - 1 # Positive? positive = (dividend > 0) is (divisor > 0) dividend = abs(dividend) divisor = abs(divisor) res = 0 subtract = divisor while divisor
Computer Science/Coding Test 2021. 9. 2. 22:05
이전 Prev 1 Next 다음