add 2044

fishercoder1534 · fishercoder1534 · commit 3d40976fef52 · 2021-10-16T21:19:34.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2044|[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2044.java) ||Medium||
 |2043|[Simple Bank System](https://leetcode.com/problems/simple-bank-system/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2043.java) ||Medium||
 |2042|[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2042.java) ||Easy||
 |2039|[The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2039.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2044.java b/src/main/java/com/fishercoder/solutions/_2044.java
@@ -0,0 +1,47 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class _2044 {
+    public static class Solution1 {
+        public int countMaxOrSubsets(int[] nums) {
+            List<List<Integer>> result = new ArrayList();
+            List<Integer> empty = new ArrayList();
+            result.add(empty);
+            Arrays.sort(nums);
+            for (int i = 0; i < nums.length; i++) {
+                List<List<Integer>> temp = new ArrayList<>();
+                for (List<Integer> list : result) {
+                    List<Integer> newList = new ArrayList(list);
+                    newList.add(nums[i]);
+                    temp.add(newList);
+                }
+                result.addAll(temp);
+            }
+            Map<Integer, Integer> map = new HashMap<>();
+            for (List<Integer> list : result) {
+                if (list.isEmpty() || list.size() == 0) {
+                    continue;
+                }
+                int or = list.get(0);
+                for (int i = 1; i < list.size(); i++) {
+                    or |= list.get(i);
+                }
+                map.put(or, map.getOrDefault(or, 0) + 1);
+            }
+            int max = 0;
+            int ans = 0;
+            for (int key : map.keySet()) {
+                if (max < key) {
+                    max = key;
+                    ans = map.get(key);
+                }
+            }
+            return ans;
+        }
+    }
+}
