1. 程式人生 > 實用技巧 >js解析

js解析

方法的定義與調動

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;
    }
}
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(){
            for (int i = 0; i <= 1000; i++) {
                if (i%5==0){
                    System.out.print(i+"\t");
                }
                if (i%(5*3)==0){ //每行
                    System.out.println();
                    //System.out.print("\n");
                }
            }
        }
    }
package com.lol.LiOu.Method;

public class Demo04 {
    public static void main(String[] args) {

        Demo04 demo04 = new Demo04();
        demo04.test(1,2,3,4,5,6);
        printMax(32,456,8545,32546468,11,22,34);
        printMax(new double[]{1,2,3});


    }
    public void test(int x, int...i){//可變引數必須放在最後面
        System.out.println(i[0]);
        System.out.println(i[1]);
        System.out.println(i[2]);
        System.out.println(i[3]);
        System.out.println(i[4]);
        System.out.println(i[5]);


    }
    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);

    }



}