samplearithmetic.java

6个经典数据结构JAVA解法

/**
 * 典型算法---最小公倍数和最大公约数（min common multiple and max common divisor）
*/
public class SampleArithmetic {
    //定义属性 
    protected static int max,min;
    /**
     * 构建器/
     * 初始化方法,给类属性赋值
     * @param int num1
     * @param int num2
     */
    public SampleArithmetic(int num1,int num2) throws Exception{
        //判断初始化参数是否是自然数/
        if (num1<=0) {
            System.out.println("input number "+num1+" must greater than 0" );
            throw new Exception("input number num1 is not plus");
        } 
        if (num2<=0) {
            System.out.println("input number "+num2+" must greater than 0" );
            throw new Exception("input number num2 is not plus");
        } 
        if (num1>num2) {
            this.max = num1;
            this.min = num2;
        }
        else {
            this.max = num2;
            this.min = num1;
        }          
    }
    /**
     * 求最小公倍数
     *
     */
    public int getMCM() {
        int i = max;
        while ((i%min!=0)||(i%max!=0)){//判断方法，从最大的开始，判断它是否能够整除min,max
           i = i+1;
        }
        return i;
    }
    /**
     * 求最大公约数
     *
     */
    public int getMCD() {
        int i = min ;
        while ((min%i!=0)||(max%i!=0)){//判断方法，从最大的开始，判断它是否能够被min,max整除
            i = i-1;
        }
        return i;    
    }
     /**
     * 主函数，测试。
     * @param String[] args
     */
    public static void main(String[] args) {
        //  run test
        try {
            SampleArithmetic sampleArithmetic = new SampleArithmetic(2,3);
            System.out.println("  "); 
            System.out.println("sampleArithmetic.getMCM() = "+sampleArithmetic.getMCM()); 
            System.out.println("sampleArithmetic.getMCD() = "+sampleArithmetic.getMCD()); 
        } 
        catch (Exception e) {
            e.printStackTrace();
        } 
    }
}