-
Notifications
You must be signed in to change notification settings - Fork 0
/
표현 가능한 이진트리.py
61 lines (51 loc) · 1.29 KB
/
표현 가능한 이진트리.py
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
56
57
58
59
60
61
"""
시작 시간: 2023-02-12 04:04 AM
소요 시간: 1시간 50분
풀이 방법:
"""
def init_doubles():
doubles = [0]
number = 2
limit = 10**15
while number <= limit:
doubles.append(number - 1)
number <<= 1
return doubles
DOUBLES = init_doubles()
def get_chipers(number):
if number == DOUBLES[1]: return 1
elif number == DOUBLES[-1]: return len(DOUBLES) - 1
start = 0
end = len(DOUBLES) - 1
middle = 0
while True:
middle = (start+ end) // 2
if end - start <= 1:
middle = end
break
if DOUBLES[middle] < number:
start = middle
elif DOUBLES[middle] > number:
end = middle
else:
break
return middle
def inspect(number):
if number == 1 or number == 0:
return 1
chiper = get_chipers(number)
half = chiper // 2
left = number >> (half + 1)
right = number % (1 << half)
print(str(bin(left))[2:], str(bin(right))[2:])
if (number >> half) % 2 == 0:
if left == 0 and right == 0:
return 1
return 0
return inspect(left) and inspect(right)
def solution(numbers):
answer = []
for number in numbers:
answer.append(inspect(number))
return answer
solution([63])