leetcode

0 class Solution {

1 public:

2 string findDifferentBinaryString(const vector<string> &nums) {

3 const unordered_set<string> us(begin(nums), end(nums));

4 const int n = nums.size();

5

6 for (int mask = 0, crnt = 0; mask < (1 << n); crnt = ++mask) {

7 string s(n, '0');

8 for (int i = n - 1; i >= 0; i--, crnt >>= 1)

9 if (crnt & 1) s[i]++;

10 if (!us.count(s)) return s;

11 }

12 return "";

13 }

14 };