파비의 매일매일 공부기록

2023.12.02 Today's Challenge 본문

Problem Solving/LeetCode

2023.12.02 Today's Challenge

fabichoi 2023. 12. 2. 23:45

https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/?envType=daily-question&envId=2023-11-30

 

Minimum One Bit Operations to Make Integers Zero - LeetCode

Can you solve this real interview question? Minimum One Bit Operations to Make Integers Zero - Given an integer n, you must transform it into 0 using the following operations any number of times: * Change the rightmost (0th) bit in the binary representatio

leetcode.com

DP로 푸는 문제

class Solution:
    def minimumOneBitOperations(self, n: int) -> int:
        if not n:
            return 0
        k, curr = 0, 1
        while (curr * 2) <= n:
            curr *= 2
            k += 1
        
        return 2 ** (k+1) - 1 - self.minimumOneBitOperations(n ^ curr)
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.12.04 Today's Challenge  (1) 2023.12.04
2023.12.03 Today's Challenge  (0) 2023.12.03
2023.12.01 Today's Challenge  (0) 2023.12.01
2023.11.30 Today's Challenge  (0) 2023.11.30
2023.11.29 Today's Challenge  (0) 2023.11.29
'Problem Solving/LeetCode' Related Articles more
Comments