diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_flips_abc.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_flips_abc.cpp')
-rw-r--r-- | other/min_flips_abc.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/min_flips_abc.cpp b/other/min_flips_abc.cpp deleted file mode 100644 index b51b261..0000000 --- a/other/min_flips_abc.cpp +++ /dev/null @@ -1,22 +0,0 @@ -// 1318. Minimum Flips to Make a OR b Equal to c -#include "leetcode.h" - -/* - * given three positive numbers 'a, b, c'. return the minimum flips required in - * some bits of 'a | b == c'. flip operation consists of changing any single bit - * 1 to 0 or changing the bit 0 to 1 in their binary representation - */ - -class Solution { -public: - int minFlips(int a, int b, int c) { - return __builtin_popcount(c ^= a | b) + __builtin_popcount(a & b & c); - } -}; - -int main() { - Solution obj; - printf("%d\n", obj.minFlips(2, 6, 5)); // expect: 3 - printf("%d\n", obj.minFlips(4, 2, 7)); // expect: 1 - printf("%d\n", obj.minFlips(1, 2, 3)); // expect: 0 -} |