Java_递归/斐波那契

 

 

 

 

斐波那契

public class exercise {
	public static void main(String[] args) {
		T t = new T();
		int ans = t.fabonacci(-1);
		System.out.println("ans = " + ans);
	}
}

class T {
	public int fabonacci(int n) {
		if (n >= 1) {
			if (n == 1 || n == 2)
				return 1;
			return fabonacci(n - 1) + fabonacci(n - 2);
		} else {
			System.out.println("输入的n要>=1");
			return -1;
		}
	}
}

吃个桃桃

public class exercise {
	public static void main(String[] args) {
		T t = new T();
		int ans = t.peach(1);
		System.out.println("ans = " + ans);
	}
}

class T {
	public int fabonacci(int n) {
		if (n >= 1) {
			if (n == 1 || n == 2)
				return 1;
			return fabonacci(n - 1) + fabonacci(n - 2);
		} else {
			System.out.println("输入的n要>=1");
			return -1;
		}
	}

	public int peach(int day) {
		if (day == 10) {
			return 1;
		} else if (day >= 1 && day <= 9) {
			return (peach(day + 1) + 1) * 2;
		} else {
			return -1;
		}
	}
}