Java-用递归求斐波那契数列并输出出来

示例：

public static int fibonacciSequence(int i) {
    if (i <= 1) {
      return i;
    }
    return fibonacciSequence(i - 1) + fibonacciSequence(i - 2);
  }

  public static void main(String[] args) {
    System.out.println("请输入要计算的位数:");
    Scanner scanner = new Scanner(System.in);
    int next = scanner.nextInt();
    for (int i = 0; i < next; i++) {
      System.out.print(" " + fibonacciSequence(i));
    }
  }

运行结果：

请输入要计算的位数:
10
 0 1 1 2 3 5 8 13 21 34
进程已结束,退出代码0