首先还是进行三步走
找变化:i打印完每次都加一
找重复:i每次加1都离j更进一步
找边界:i大于j了程序就结束
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int i = input.nextInt();
int j = input.nextInt();
dfs(i,j);
}
static void dfs(int i,int j){
if(i > j){
return;
}
System.out.println(i);
dfs(i+1,j);
}
}
1 10
1
2
3
4
5
6
7
8
9
10