1+2+3+...+n 递归
public class Sum {
public static int count(int n) {
if(n=1)
return 1;
if (n > 1) {
return count(n - 1) + n;
}
}
}
public class Sum {
public static int count(int n) {
if(n=1)
return 1;
if (n > 1) {
return count(n - 1) + n;
}
}
}