fix: 다단계 칫솔/jujoo.py

Author: JadeKim042386

[211122] 다단계 칫솔/jujoo.py

@@ -1,26 +1,17 @@
+class Sell:
+    def __init__(self, enroll, referral, seller, amount):
+        self.answer = [0] * len(enroll)
+        self.referral = referral
+        self.enroll_idx = {val : idx for idx, val in enumerate(enroll)}
+        for cur_seller, cur_amount in zip(seller, amount):
+            self.dfs(cur_seller, cur_amount * 100)
+    def dfs(self, cur_seller, cur_amount):
+        if cur_amount < 1 or cur_seller == '-':
+            return
+        cur_idx = self.enroll_idx[cur_seller]
+        self.answer[cur_idx] += cur_amount - int(cur_amount * 0.1)
+        self.dfs(self.referral[cur_idx], int(cur_amount * 0.1))
+
 def solution(enroll, referral, seller, amount):
-    loc_data = {node : idx for idx, node in enumerate(enroll)}
-    result = [0] * len(enroll)
-    
-    root_list = []
-    for leaf in seller:
-        tmp = [leaf]
-        cur_idx = loc_data[leaf]
-        while referral[cur_idx] != '-':
-            tmp.append(referral[cur_idx])
-            cur_idx = loc_data[referral[cur_idx]]
-        tmp.append('center')
-        root_list.append(tmp)
-    
-    for idx, price in enumerate(amount):
-        price *= 100
-        cur_root = root_list[idx]
-        for node in cur_root[:-1]:
-            price_10 = int(price * 0.1)
-            result[loc_data[node]] += price - price_10
-            if price_10 < 1:
-                break
-            price = price_10
-    return result
-    
-    
+    sell = Sell(enroll, referral, seller, amount)
+    return sell.answer

[211215] 2개 이하로 다른 비트/jujoo.py

@@ -0,0 +1,17 @@
+def solution(numbers):
+    answer = []
+    for number in numbers:
+        bin_number = str(bin(number)[2:])
+        if bin_number[-2:] in ['00', '10', '01'] or number in [0, 1]:
+            answer.append(number + 1)
+        else:
+            # reversed(range(2, len(bin_number) + 1)) = [3, 2]
+            for i in reversed(range(2, len(bin_number) + 1)):
+                # i = 3, number = 7
+                # bin_number[-i:] = 111
+                if '0' not in bin_number[-i:]:
+                    answer.append(number + 2**(i - 1))
+                    break
+    return answer
+
+print(solution([0, 555, 123, 100000, 99999, 1000000000, 999999999999, 10**15, 10**15 -1]))