We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c22a253 commit b46f2b4Copy full SHA for b46f2b4
scripts/algorithms/C/Count Number of Maximum Bitwise-OR Subsets/Count Number of Maximum Bitwise-OR Subsets.js
@@ -1,17 +1,18 @@
1
+// Runtime: 509 ms (Top 12.12%) | Memory: 43.2 MB (Top 78.79%)
2
/**
3
* @param {number[]} nums
4
* @return {number}
5
*/
6
var countMaxOrSubsets = function(nums) {
-
7
+
8
let n = nums.length;
9
let len = Math.pow(2, n);
10
let ans = 0;
11
let hash = {};
12
- for (let i = 0; i < len; i++) {
13
+ for (let i = 0; i < len; i++) {
14
let tmp = 0;
- for (let j = 0; j < n; j++) {
15
+ for (let j = 0; j < n; j++) {
16
if(i & (1 << j)) {
17
tmp |= nums[j];
18
}
@@ -23,6 +24,6 @@ var countMaxOrSubsets = function(nums) {
23
24
25
ans = Math.max(ans, tmp);
26
27
28
return hash[ans];
-};
29
+};
0 commit comments