比如计算从1到200用递归计算怎么写?int result = 0; public static void main(String[] args) { test t = new test();
System.out.println(t.digui(1)); } public int digui(int number) {
result = result + number;
number++;
while (number <= 200) {
digui(number);
System.out.println(result);
}
return result;
}
咋一直死循环?
System.out.println(t.digui(1)); } public int digui(int number) {
result = result + number;
number++;
while (number <= 200) {
digui(number);
System.out.println(result);
}
return result;
}
咋一直死循环?
public class Test07 {
int result = 0; public void digui(int number) {
if (number > 200) {
return;
} result += number;
digui(number + 1);
} public static void main(String[] args) {
Test07 t = new Test07();
t.digui(0);
System.out.println(t.result);
}
}
int result = 0;public static void main(String[] args) {test t = new test();
System.out.println(t.digui(1));}public int digui(int number) {
result = result + number;
number++;
if (number <= 200) {
digui(number);
System.out.println(result);
}
return result;
}就不会死循环了
int result = 0;public static void main(String[] args) {test t = new test();
System.out.println(t.digui(1));}public int digui(int number) {
result = result + number;
number++;
if (number <= 200) {
digui(number);
System.out.println(result);
}else{
return result;
}
}就不会死循环了
问题都没描述清楚public static void main(String[] args) { test t = new test();
System.out.println(t.digui(200));}public int digui(int number) { //递归求和
if (number <= 1) return number;
return number + digui(number-1);
}
int digui(int n)
{
if(n==0)
{
return n;
}
else
{
return n+digui(n-1);
}
}
while (number <= 5) {
digui(number);
System.out.println(result);
}
number=2 满足number<=5的条件,所以会一直执行while循环。
int result = 0;
public static void main(String[] args) {
Test1 t = new Test1();
t.digui(1);
}public void digui(int number) {
result = result + number;
number++;
if (number <= 20) {
digui(number);
}else
System.out.println(result);
}}
public class Test {
public static void main(String[] args) {
Test t = new Test();
System.out.println(t.digui(200));
} public int digui(int number) {
if(number == 1){
return 1;
}else{
return number + digui(number - 1);
}
}
}