
[LeetCode] 1980. Find Unique Binary String (Python)
·
알고리즘/LeetCode
난이도: Medium문제 설명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"Expla..