-
Notifications
You must be signed in to change notification settings - Fork 2
/
2680.cpp
53 lines (50 loc) · 1.47 KB
/
2680.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
class Solution {
public:
long long maximumOr(vector<int>& nums, int k) {
int highestBit = 0;
for (auto num : nums) {
int highBit = 0;
while (num > 0) {
num /= 2;
highBit++;
}
highestBit = max(highestBit, highBit);
}
vector<int> bitCnts(32, 0);
vector<vector<int>> bits;
for (auto num : nums) {
int highBit = 0;
vector<int> bit(32, 0);
while (num > 0) {
bit[highBit] = num & 1;
num /= 2;
highBit++;
}
if (highBit == highestBit) {
bits.push_back(bit);
}
for (int i = 0; i < 32; ++i) bitCnts[i] += bit[i];
}
long long maxValue = 0;
for (auto bit : bits) {
long long current = 0;
for (int i = 0; i < 32; ++i) {
if (bit[i]) {
current += 1 << i;
bitCnts[i]--;
}
}
current <<= k;
for (int i = 0; i < 32; ++i) {
if (bitCnts[i] && (current & (1 << i)) == 0) {
current += 1 << i;
}
}
maxValue = max(maxValue, current);
for (int i = 0; i < 32; ++i) {
if (bit[i]) bitCnts[i]++;
}
}
return maxValue;
}
};