Package g3201_3300.s3211_generate_binary_strings_without_adjacent_zeros

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3211 - Generate Binary Strings Without Adjacent Zeros.

    Medium

    You are given a positive integer n.

    A binary string x is valid if all substrings of x of length 2 contain at least one "1".

    Return all valid strings with length n ** , ** in any order.

    Example 1:

    Input: n = 3

    Output: "010","011","101","110","111"

    Explanation:

    The valid strings of length 3 are: "010", "011", "101", "110", and "111".

    Example 2:

    Input: n = 1

    Output: "0","1"

    Explanation:

    The valid strings of length 1 are: "0" and "1".

    Constraints:

    • 1 <= n <= 18

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<String> validStrings(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait