Java方法

JAVA方法

1.新建对象

package 测试标识符;

public class TestMethod {
	public static void main(String[] args) {
		TestMethod TM=new TestMethod();
		TM.TestPrint();
		int c=TM.add(80, 85, 75)+1;
		System.out.println(c);
	}
	
	
	void TestPrint() {
		System.out.println("adaaff");
		System.out.println("adaaff");
		System.out.println("adaaff");
	}
	
	int add(int a,int b,int c) {
		int sum=a+b+c;
		System.out.println(sum);
		return sum;
	}

}

2.方法重载

package 测试标识符;

public class TestMethod {
	public static void main(String[] args) {
		add(5,6);
		System.out.println(add(1,2,3)+1);
		System.out.println(add(4,3.5));
	}
	
	public static void add(int a,int b) {
		int sum=a+b;
		System.out.println(sum);
		
	}
	
	public static int add(int a,int b,int c ) {
		int sum=a+b+c;
		return sum;
	}
	
	public static double add(int a,double b) {
		double sum=a+b;
		return sum;
	}
	
	

}

3.计算N的阶层（递归和循环）

package 测试标识符;
import java.util.Scanner;

public class TestDigui {
	 public static void main(String[] args) {
	        long d1 = System.currentTimeMillis();  
	        System.out.printf("%d阶乘的结果:%s%n", 10, factorial(10));
	        long d2 = System.currentTimeMillis();
	        System.out.printf("递归费时：%s%n", d2-d1);  //耗时：32ms
	        XunHuan(10);
	    }
	    /** 求阶乘的方法:递归*/
	    static long  factorial(int n){
	        if(n==1){//递归头
	            return 1;
	        }else{//递归体
	            return n*factorial(n-1);//n! = n * (n-1)!
	        }
	    }
	    /** 求阶乘的方法:循环*/
	    
	    static long result=1;
	    static long XunHuan(int n) {
	    	long d3=System.currentTimeMillis();
	    	while(n>1) {
	    		result*=n*(n-1);
	    		n-=2;
	    	}
	    	long d4=System.currentTimeMillis();
	    	System.out.println("10的阶层为："+result);
	    	System.out.printf("循环费时：%s%n", d4-d3);
	    	return result;
	    }
	    
	    
}