Description
Given 3 positives numbers a
, b
and c
. Return the minimum flips required in some bits of a
and b
to make ( a
OR b
== c
). (bitwise OR operation).
Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.
Example 1:
Input: a = 2, b = 6, c = 5 Output: 3 Explanation: After flips a = 1 , b = 4 , c = 5 such that (a
ORb
==c
)
Example 2:
Input: a = 4, b = 2, c = 7 Output: 1
Example 3:
Input: a = 1, b = 2, c = 3 Output: 0
Constraints:
1 <= a <= 10^9
1 <= b <= 10^9
1 <= c <= 10^9
Solution
Python3
class Solution:
def minFlips(self, a: int, b: int, c: int) -> int:
res = 0
for i in range(32):
ones = 0
if a & (1 << i):
ones += 1
if b & (1 << i):
ones += 1
if c & (1 << i):
if ones == 0:
res += 1
else:
res += ones
return res