public class Recursion
{
//static int i = 19 ;
public static void main(String[] args)
{
//System.out.println("Hello World!");
//System.out.println("sum = " + fun(100));
//System.out.println("abs = " + abs(-10));
//System.out.println("298 = " + (298/100)*100 + " + " +((298%100)/10)*10 + " + " + (298%100)%10);
//narcissus();//narcissus 水仙花数
//sum(60);
//System.out.print(Long.MAX_VALUE);
}
//递归方法 取1+2+3...+100
public static int fun(int n){
//System.out.println("Hello World!");
//int sum = 0;
if(n==1){
return 1;
}else{
return n+fun(n-1);
}
}
//取绝对值 例如 整数
public static int abs(int n){
int abs=n>=0?n:n*(-1);
return abs;
}
//水仙花数
public static void narcissus(){
int a = 0;
int b = 0;
int c = 0;
for(int i=100;i<=999;i++){
a=i/100;//百位
b=i%100/10; //十位
c=i%100%10;//个位
if(i==(a*a*a+b*b*b+c*c*c)){
System.out.print("/t" + i);
}else{
continue;
}
}
}
//
public static void sum(int num){
long a[] = new long[num];
long sum = 0L;
if(num>=2){
a[0]=0L;
a[1]=1L;
}else{
System.out.print("输入的值有误,必须>=2 !");
System.exit(-1);
}
for(int i=2;i
a[i]=a[i-1]+a[i-2];
}
for(int i=0;i
System.out.print("/t" + a[i]);
sum+=a[i];
}
System.out.print("/nsum = " + sum);
//sum +=a+b+sum(a-1,b-1) ;
}
}