leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2568.cpp (388B)

0 class Solution { 1 public: 2 int minImpossibleOR(const vector<int> &nums) const { 3 vector<bool> seen(32, false); 4 5 for (const int n : nums) { 6 if (__builtin_popcount(n) != 1) continue; 7 seen[__builtin_ffs(n) - 1] = true; 8 } 9 10 for (int i = 0; i < 32; i++) { 11 if (!seen[i]) return 1 << i; 12 } 13 return -1; 14 } 15 };