--- tags: Cmoney_Java題目 --- Java_Cmoney_ft8106 ===   1.奇妙的遞迴 --- n 會有 n 個 (n - 1) 的次主枝,加上自己的主枝。 所以 2 會有 1 個 1 的次主枝,加上自己的 1 個主枝。 所以 3 會有 3 個 2 的次主枝,加上自己的 1 個主枝。 ```java= import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); System.out.println(f(n)); } public static int f(int n) { if (n <= 1) return n; return n * f(n - 1) + 1; } } ```
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up