find-unique-binary-string

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

&nbsp;
Example 1:

<pre>
Input: nums = [&quot;01&quot;,&quot;10&quot;]
Output: &quot;11&quot;
Explanation: &quot;11&quot; does not appear in nums. &quot;00&quot; would also be correct.
</pre>

Example 2:

<pre>
Input: nums = [&quot;00&quot;,&quot;01&quot;]
Output: &quot;11&quot;
Explanation: &quot;11&quot; does not appear in nums. &quot;10&quot; would also be correct.
</pre>

Example 3:

<pre>
Input: nums = [&quot;111&quot;,&quot;011&quot;,&quot;001&quot;]
Output: &quot;101&quot;
Explanation: &quot;101&quot; does not appear in nums. &quot;000&quot;, &quot;010&quot;, &quot;100&quot;, and &quot;110&quot; would also be correct.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 16</code></li>
	<li><code>nums[i].length == n</code></li>
	<li><code>nums[i] </code>is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
	<li>All the strings of <code>nums</code> are unique.</li>
</ul>

findDifferentBinaryString

Find Unique Binary String

Missing Number

missing-number

丢失的数字

Find All Numbers Disappeared in an Array

find-all-numbers-disappeared-in-an-array

找到所有数组中消失的数字

Random Pick with Blacklist

random-pick-with-blacklist

黑名单中的随机数

Array

Hash Table

String

Backtracking

给你一个字符串数组 <code>nums</code> ，该数组由 <code>n</code> 个 互不相同 的二进制字符串组成，且每个字符串长度都是 <code>n</code> 。请你找出并返回一个长度为&nbsp;<code>n</code>&nbsp;且&nbsp;没有出现 在 <code>nums</code> 中的二进制字符串。如果存在多种答案，只需返回 任意一个 即可。

&nbsp;

示例 1：

<pre>
输入：nums = ["01","10"]
输出："11"
解释："11" 没有出现在 nums 中。"00" 也是正确答案。
</pre>

示例 2：

<pre>
输入：nums = ["00","01"]
输出："11"
解释："11" 没有出现在 nums 中。"10" 也是正确答案。
</pre>

示例 3：

<pre>
输入：nums = ["111","011","001"]
输出："101"
解释："101" 没有出现在 nums 中。"000"、"010"、"100"、"110" 也是正确答案。</pre>

&nbsp;

提示：

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 16</code></li>
	<li><code>nums[i].length == n</code></li>
	<li><code>nums[i] </code>为 <code>'0'</code> 或 <code>'1'</code></li>
	<li><code>nums</code> 中的所有字符串 互不相同</li>
</ul>