leetcode-problems-solution/1980_find_unique_bin_str.cpp at main · mohin-73/leetcode-problems-solution · GitHub

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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <bits/stdc++.h>

using namespace std;

class Solution {
public:
    string findDifferentBinaryString(vector<string>& nums) {
        int n = nums.size();
        int r, size = (2 << n) + 1;
        vector<bool> lookUp(size, false);
        for (string s : nums) {
            int k = 0, b = 0;
            for (int i = n - 1; i >= 0; --i) {
                if (s[i] == '1') {
                    k += 1 << b;
                }
                ++b;
            }
            if (k <= size) {
                lookUp[k] = true;
            }
        }
        for (int i = 0; i <= size; ++i) {
            if (!lookUp[i]) {
                r = i;
                break;
            }
        }
        string uniqueBinStr;
        while (uniqueBinStr.length() < n) {
            uniqueBinStr = to_string(r % 2) + uniqueBinStr;
            r /= 2;
        }
        return uniqueBinStr;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<string> nums = {"01", "10"};
    Solution solve;
    string result = solve.findDifferentBinaryString(nums);
    cout << result << '\n';
    return 0;
}

/*
    ------------------
    Problem Statement:
    ------------------

    Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums. If there are multiple answers, you may return any of them.

    ----------
    Example 1:
    ----------

    Input: nums = ["01","10"]
    Output: "11"
    Explanation: "11" does not appear in nums. "00" would also be correct.

    ----------
    Example 2:
    ----------

    Input: nums = ["00","01"]
    Output: "11"
    Explanation: "11" does not appear in nums. "10" would also be correct.

    ----------
    Example 3:
    ----------

    Input: nums = ["111","011","001"]
    Output: "101"
    Explanation: "101" does not appear in nums. "000", "010", "100", and "110" would also be correct.

    ------------
    Constraints:
    ------------

    n == nums.length
    1 <= n <= 16
    nums[i].length == n
    nums[i] is either '0' or '1'.
    All the strings of nums are unique.
*/