class Solution:
def minFlips(self, a: int, b: int, c: int) -> int:
count = 0
while(a>0 or b>0 or c>0):
a_rem = a % 2
b_rem = b % 2
c_rem = c % 2
if c_rem == 1:
if a_rem==0 and b_rem==0:
count += 1
elif c_rem == 0:
count = count + a_rem + b_rem
a = a //2
b = b // 2
c = c // 2
return count
leetcode 1318. 或运算的最小翻转次数
最新推荐文章于 2024-04-26 09:02:35 发布