_1980.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;
importjava.util.HashSet;
importjava.util.Set;

publicclass_1980 {
publicstaticclassSolution1 {
publicStringfindDifferentBinaryString(String[] nums) {
Set<String> set = newHashSet<>(Arrays.asList(nums));
intlen = nums[0].length();
StringBuildersb = newStringBuilder();
inti = 0;
while (i < len) {
sb.append(1);
i++;
 }
intmax = Integer.parseInt(sb.toString(), 2);
for (intnum = 0; num <= max; num++) {
Stringbinary = Integer.toBinaryString(num);
if (binary.length() < len) {
sb.setLength(0);
sb.append(binary);
while (sb.length() < len) {
sb.insert(0, "0");
 }
binary = sb.toString();
 }
if (!set.contains(binary)) {
returnbinary;
 }
 }
returnnull;
 }
 }
}