Skip to content

Create 2044. Count Number of Maximum Bitwise-OR Subsets #612

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

Merged
merged 1 commit into from
Oct 18, 2024
Merged

Create 2044. Count Number of Maximum Bitwise-OR Subsets #612

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
21 changes: 21 additions & 0 deletions 2044. Count Number of Maximum Bitwise-OR Subsets
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
class Solution {
public:
int countMaxOrSubsets(vector<int>& nums) {
int mx_or = 0, n = nums.size();
for(int x: nums) mx_or |= x;

int total_subsets = pow(2, n)-1;

int cnt = 1;
for(int i=1;i<total_subsets; i++) {
int or_sub = 0;
for(int j=0;j<n;j++) {
int x = 1<<j;
if(x&i) or_sub |= nums[j];
}
if(or_sub==mx_or) ++cnt;
}

return cnt;
}
};
Loading