蓝桥杯 算法训练 s01串

PS:猛地一看真的不太明白这题是啥意思，后来百度了一下S01串到底是什么，看了下也就是f(n) = f(n - 2) + f(n - 1)这个简单递归

import java.util.Scanner;
public class Main {

    public static String digui(int num) {
        if(num == 0) {
            return "0";
        }else if(num == 1) {
            return "1";
        }else {
            return digui(num - 2) + digui(num - 1);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        System.out.println(digui(num));
    }
}