[최민지] Day03

leetcode3/최민지/3774.py

@@ -0,0 +1,7 @@
+class Solution:
+    def absDifference(self, nums: List[int], k: int) -> int:
+        nums.sort()
+        s_len = len(nums)
+        x = sum(nums[-k:])
+        y = sum(nums[:k])
+        return abs(x - y)

leetcode3/최민지/3827.py

@@ -0,0 +1,14 @@
+class Solution:
+    def countMonobit(self, n: int) -> int:
+        result = 1
+
+        x = 1
+        while x <= n:
+            result += 1
+            x = x * 2 + 1
+        return result
+
+       # 0  2^0 -1
+       # 1  2^1 -1
+       # 11 2^2 -1
+       # 111 2^3 -1 

leetcode3/최민지/870.py

@@ -0,0 +1,17 @@
+class Solution:
+    def advantageCount(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        nums1.sort()
+
+        nums2_sort = sorted([(value, i) for i, value in enumerate(nums)])
+
+        n = len(nums1)
+        answer = [0] * n
+        left = 0
+        right = n-1
+
+        #for value, i in reversed(nums2_sort):
+        #    if nums1[i] > value:
+        #        answer[i] = nums1[right]
+        #        right -= 1
+        #    else
+        return ans