From 9725cd9fd98dd97ae65fb65ee083c587d9542534 Mon Sep 17 00:00:00 2001 From: Amit S Sahu Date: Fri, 18 Oct 2024 07:31:30 +0530 Subject: [PATCH] Time: 73 ms (27.71%), Space: 46.8 MB (14.62%) - LeetHub --- ...-number-of-maximum-bitwise-or-subsets.java | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2044-count-number-of-maximum-bitwise-or-subsets/2044-count-number-of-maximum-bitwise-or-subsets.java diff --git a/2044-count-number-of-maximum-bitwise-or-subsets/2044-count-number-of-maximum-bitwise-or-subsets.java b/2044-count-number-of-maximum-bitwise-or-subsets/2044-count-number-of-maximum-bitwise-or-subsets.java new file mode 100644 index 0000000..c1419de --- /dev/null +++ b/2044-count-number-of-maximum-bitwise-or-subsets/2044-count-number-of-maximum-bitwise-or-subsets.java @@ -0,0 +1,23 @@ +class Solution { + List or = new ArrayList<>(); + public int countMaxOrSubsets(int[] nums) { + helper(0, nums, 0); + Collections.sort(or, Collections.reverseOrder()); + int max = or.get(0); + int ans = 0; + for (Integer i: or){ + if (max == i) ans++; + else break; + } + return ans; + } + public void helper(int index,int[] nums,int sum){ + if (index == nums.length){ + or.add(sum); + return; + } + int val = (sum | nums[index]); + helper(index+1,nums,val); + helper(index+1,nums,sum); + } +} \ No newline at end of file