// recursive
// recursive factorial of N
import java.util.Scanner;
public class Test39{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int num=scanner.nextInt();
int ret = factor (whether);
System.out.println("ret="+ret);
}
public static int factor(int n){
if(n==1){
return 1;
}
return n*factor(n-1);
}
}
// recursion 1 + 2 + 3 + ... + 10
public class Test40{
public static void main(String[] args) {
System.out.println(Add(10));
}
public static int Add(int n){
if(n==1){
return 1;
}
return n+Add(n-1);
}
}
// print a digital sequence for each bit (e.g. 1234 1 234 prints out) (recursively)
import java.util.Scanner;
public class Test41{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
System.out.println ( "Enter an integer");
int num=scanner.nextInt();
print (whether);
}
public static void print(int n){
if(n>9){
print (n/10);
}
System.out.println(n%10);
}
}
/ 4, write a recursive method, enter a non-negative integer, it returns the sum of the numbers and composition.
import java.util.Scanner;
public class Test42{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
System.out.println ( "Please enter a non-negative integer");
int num=scanner.nextInt();
System.out.println(Add(num));
}
public static int Add(int n){
if(n<10){
return n;
}
return n%10+Add(n/10);
}
}
// 5, recursion Item N Fibonacci column
import java.util.Scanner;
public class Test43{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
System.out.println ( "Enter an integer");
int num=scanner.nextInt();
System.out.println(fibonacci(num));
}
public static int fibonacci(int n){
if(n==1||n==2){
return 1;
}
return fibonacci(n-1)+fibonacci(n-2);
}
}
/ 7, recursive implementation code: frog jump stairs questions
// A frog can jump on a Class 1 level, you can also hop on level 2. The frog jumped seeking a total of n grade level how many jumps
import java.util.Scanner;
public class Test45{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
System.out.println ( "Please enter the number of steps");
int num=scanner.nextInt();
System.out.println(kind(num));
}
public static int kind(int n){
if(n==0){
return 0;
}else if(n==1||n==2){
return n;
}
return kind(n-2)+kind(n-1);
}
}