Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create 10_bitwiseAnd.cpp #155

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create 10_bitwiseAnd.cpp #155

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletions 10 October LeetCode Challenge 2021/10_bitwiseAnd.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
class Solution {
public:
int rangeBitwiseAnd(int m, int n) {
// edge case - zero AND anything will always stay zero
if ((m == 0) || (n == 0)) return 0;

// if there is a different amount of digits in binary - always will be zero
if ((int)log2(m) != (int)log2(n)) return 0;

// None of the above - not too many numbers left to calculate one by one...
int res = m;
for (long i = m; i <= n; i++)
res &= i;

return res;
}
};