问描述一种递归算法，用于打印不包含任何连续1的所有N位二进制字符串

EN

def gen(n):
  if n == 0:
    yield ''
    return
  for s in gen(n-1):
    yield s + '0'
    if s == '' or s[-1] == '0':
      yield s + '1'

for s in gen(5):
  print(s)

def f(n, result=""):
    if n==0:
        print(result)
        return

    if len(result) == 0 or result[-1]=="0":
        f(n-1, result+"1")
    f(n-1, result+"0")

void printNDigitBinaries(int n) {
    printBinHelper(n, "");
}

void printBinHelper(int n, String s) {
    if (s.length() == n) {
        System.out.println(s);
        return;
    }

    printBinHelper(n, s+"0");
    if (s.length() == 0 || s.charAt(s.length()-1) != '1') printBinHelper(n, s+"1");
}