Download Algorithm_project/Case_module/src/Case3_package/Test.java from zxy0307/Java: direct link, hf CLI and curl.
- Browser
- Download file 1.04 kB
-
https://huggingface.co/zxy0307/Java/resolve/main/Algorithm_project/Case_module/src/Case3_package/Test.java
- Command line
-
hf download hf://zxy0307/Java/Algorithm_project/Case_module/src/Case3_package/Test.java
-
curl -L -o Test.java https://huggingface.co/zxy0307/Java/resolve/main/Algorithm_project/Case_module/src/Case3_package/Test.java
1.04 kB
| package Case3_package; | |
| public class Test { | |
| public static void main(String[] args) { | |
| /* | |
| 有一堆桃子,猴子第一天吃了其中的一半,并多吃了一个; | |
| 以后每天猴子都吃当前剩下来的一半,然后再多吃一个, | |
| 第10天的时候(还没吃),发现只剩下一个桃子了。请问,最初总共多少个桃子? | |
| day10:1 | |
| day9:(day10 + 1) * 2 = 4 | |
| 1、出口 | |
| day == 10 剩下1 | |
| 2、规律 | |
| 每一天的桃子数量都是后一天数量+1,乘以2 | |
| */ | |
| System.out.println(getCount(1)); | |
| } | |
| public static int getCount(int day) { | |
| if (day <= 0 || day >= 11) { | |
| System.out.println("当前时间错误"); | |
| return -1; | |
| } | |
| //递归的出口 | |
| if (day == 10) { | |
| return 1; | |
| } | |
| //书写规律 | |
| //每一天的桃子数量都是后一天数量+1,乘以2 | |
| return (getCount(day + 1) + 1) * 2; | |
| } | |
| } | |