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_one_bit_0.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_one_bit_0.cpp')
-rw-r--r-- | other/min_one_bit_0.cpp | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/other/min_one_bit_0.cpp b/other/min_one_bit_0.cpp deleted file mode 100644 index 9820ace..0000000 --- a/other/min_one_bit_0.cpp +++ /dev/null @@ -1,18 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - unordered_map<int, int> um{{0, 0}}; - inline int bto0(int b) { return (1 << (b + 1)) - 1; } - int minimumOneBitOperations(int n) { - if (um.count(n)) - return um[n]; - int b = 31 - __builtin_clz(n); - return um[n] = bto0(b) - minimumOneBitOperations(n - (1 << b)); - } -}; - -int main() { - Solution obj; - cout << obj.minimumOneBitOperations(39769175); // expect 4 -} |