2275. Largest Combination With Bitwise AND Greater Than Zero
统计这些candidates的二进制数值哪个位元的1最多
就知道最多能AND多少数值最后大于零
public int LargestCombination(int[] candidates)
{
var count = new int[32];
for (int i=0;i<count.Length;i++)
{
foreach (var candidate in candidates)
{
if (((candidate >> i) & 1) > 0)
{
count[i]++;
}
}
}
return count.Max();
}