-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdivide_two_num.py
More file actions
55 lines (46 loc) · 1.2 KB
/
divide_two_num.py
File metadata and controls
55 lines (46 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import sys
# https://leetcode.com/problems/divide-two-integers/
def divide(dividend, divisor):
isNegative = 0
if dividend < 0:
isNegative += 1
if divisor < 0:
isNegative += 1
if isNegative % 2 == 0:
isNegative = False
else:
isNegative = True
# if abs(divisor) == 1:
# if isNegative:
# return 0 - abs(dividend)
# else:
# return abs(dividend)
dividend = abs(dividend)
divisor = abs(divisor)
quotient = 0
# sum = divisor
# while sum <= dividend:
# sum += divisor
# quotient += 1
# if quotient > 2 ** 31 - 1:
# if isNegative:
# return -(2 ** 31)
# else:
# return 2 ** 31 - 1
# if isNegative:
# quotient = 0 - quotient
# return quotient
count = 1
denom = divisor
while denom <= dividend:
denom *= divisor
count *= divisor
print('count:', count)
print('denom: ', denom)
def main():
str = input('input: ')
dividend, divisor = str.split()
result = divideNew(int(dividend), int(divisor))
print('output: ', result)
if __name__ == '__main__':
main()