Largest Combination With Bitwise AND Greater Than Zero
The bitwise AND of an array nums is the bitwise AND of all integers in nums.
- For example, for
nums = [1, 5, 3], the bitwise AND is equal to1 & 5 & 3 = 1. - Also, for
nums = [7], the bitwise AND is7.
You are given an array of positive integers candidates. Compute the bitwise AND for all possible combinations of elements in the candidates array.
Return the size of the largest combination of candidates with a bitwise AND greater than 0.
Example 1
Input
candidates = [16,17,71,62,12,24,14]Output
4The combination [16, 17, 62, 24] has a bitwise AND of 16, and it can be shown that no larger combination has a bitwise AND greater than 0.
Example 2
Input
candidates = [8,8]Output
2The largest combination [8, 8] has a bitwise AND of 8, so its size is 2.
Constraints
- 1 <= candidates.length <= 10^5
- 1 <= candidates[i] <= 10^7