mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 01:49:41 +01:00
39 lines
714 B
C++
39 lines
714 B
C++
|
#include <cassert>
|
||
|
#include <tuple>
|
||
|
|
||
|
class Solution {
|
||
|
public:
|
||
|
int minFlips(int a, int b, int c)
|
||
|
{
|
||
|
auto flips = 0;
|
||
|
|
||
|
for (; (a | b) != c; a >>= 1, b >>= 1, c >>= 1) {
|
||
|
auto [aa, bb, cc] = std::tuple { a & 1, b & 1, c & 1 };
|
||
|
|
||
|
if ((aa | bb) == cc) {
|
||
|
continue;
|
||
|
}
|
||
|
|
||
|
if (aa && bb) {
|
||
|
flips += 2;
|
||
|
} else {
|
||
|
flips++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return flips;
|
||
|
}
|
||
|
};
|
||
|
|
||
|
int main()
|
||
|
{
|
||
|
Solution s;
|
||
|
|
||
|
assert(s.minFlips(2, 6, 5) == 3);
|
||
|
assert(s.minFlips(4, 2, 7) == 1);
|
||
|
assert(s.minFlips(1, 2, 3) == 0);
|
||
|
assert(s.minFlips(8, 3, 5) == 3); // 1000 | 0011 = 0101
|
||
|
|
||
|
return 0;
|
||
|
}
|