package top.iyunsir.method;

import java.util.Scanner;

public class Demo01 {
    //main方法
    public static void main(String[] args) {

        //实际参数: 实际调用传递给他的参数
        int sum = add(1, 2);
        System.out.println(sum);
//        test();
    }

    //加法
    //形式参数,用来定义作用的
    public static int add(int a,int b ){
        return a+b;
    }

    public static void test(){
        //考试分数大于60是及格,小于60分是不及格。

        Scanner scanner = new Scanner(System.in);
        System.out.println("请输入成绩: ");
        int score = scanner.nextInt();

        if (score>60){
            System.out.println("及格");
        }else {
            System.out.println("不及格");
        }
    }

}

package top.iyunsir.method;

public class Demo02 {
    public static void main(String[] args) {
        int max = max(10, 20);
        System.out.println(max);

    }
    //比大小
    public static int max(int num1,int num2){

        int result = 0;
        if (num1==num2){
            System.out.println("num1==num2");
            return 0; //终止方法
        }
        if (num1>=num2){
            result = num1;
        }else {
            result = num2;
        }

        return result;

    }
}

package top.iyunsir.method;

public class Demo03 {

    public static void main(String[] args) {
        //args.length 数组长度
        for (int i = 0; i <args.length ; i++) {
            System.out.println("args["+i+"]:"+args[i]);

        }
    }
}

package top.iyunsir.method;

public class Demo03 {

    public static void main(String[] args) {
        //args.length 数组长度
        for (int i = 0; i <args.length ; i++) {
            System.out.println("args["+i+"]:"+args[i]);

        }
    }
}

package top.iyunsir.method;

public class Demo04 {

    public static void main(String[] args) {
        //调用可变参数的方法
        PrintMax(1,3,5,61,2,521,421,21);
        PrintMax(41,34,12,42,124,412,5211);
    }

    public static void PrintMax(double... numbers) {
        if (numbers.length ==0){
            System.out.println("No argument passed");
            return;
        }

        double result = numbers[0];

        //排序！
        for (int i = 1; i < numbers.length; i++) {
            if (numbers[i] > result){
                result = numbers[i];
            }

        }
        System.out.println("The max value is " + result);

    }
}

递归

package top.iyunsir.method;

public class Demo06 {
    //2! 2*1 阶乘
    //3! 3*2*1
    //5! 5*4*3*2*1

    //递归思想
    public static void main(String[] args) {
        System.out.println(f(4));

    }
    public static int f(int n ){
        if (n==1){
            return 1;
        }else {
            return n*f(n-1);
        }

    }

}

作业