From 94376976554e76e518008944977cd35c5f26e172 Mon Sep 17 00:00:00 2001 From: choiminji Date: Wed, 2 Sep 2026 23:54:20 +0900 Subject: [PATCH 1/2] 0902 --- .../\354\265\234\353\257\274\354\247\200/3827.py" | 14 ++++++++++++++ 1 file changed, 14 insertions(+) create mode 100644 "leetcode3/\354\265\234\353\257\274\354\247\200/3827.py" diff --git "a/leetcode3/\354\265\234\353\257\274\354\247\200/3827.py" "b/leetcode3/\354\265\234\353\257\274\354\247\200/3827.py" new file mode 100644 index 00000000..be1b8878 --- /dev/null +++ "b/leetcode3/\354\265\234\353\257\274\354\247\200/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 \ No newline at end of file From 453d15c4515f011d1b197478cec1dbf224ce675a Mon Sep 17 00:00:00 2001 From: choiminji Date: Thu, 3 Sep 2026 22:40:14 +0900 Subject: [PATCH 2/2] 260903 --- .../3774.py" | 7 +++++++ .../870.py" | 17 +++++++++++++++++ 2 files changed, 24 insertions(+) create mode 100644 "leetcode3/\354\265\234\353\257\274\354\247\200/3774.py" create mode 100644 "leetcode3/\354\265\234\353\257\274\354\247\200/870.py" diff --git "a/leetcode3/\354\265\234\353\257\274\354\247\200/3774.py" "b/leetcode3/\354\265\234\353\257\274\354\247\200/3774.py" new file mode 100644 index 00000000..b5dc3520 --- /dev/null +++ "b/leetcode3/\354\265\234\353\257\274\354\247\200/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) \ No newline at end of file diff --git "a/leetcode3/\354\265\234\353\257\274\354\247\200/870.py" "b/leetcode3/\354\265\234\353\257\274\354\247\200/870.py" new file mode 100644 index 00000000..ae35ea5a --- /dev/null +++ "b/leetcode3/\354\265\234\353\257\274\354\247\200/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 \ No newline at end of file