ou.java

来自「欧几里德算法又称辗转相除法」· Java 代码 · 共 55 行

package algorithm;
/**
 *<p>hibernate-tutorialDescription:欧几里德算法</p>
 *@version1.0.0
 *@CopyrightCopyright(c)2008
 */
publicclass MaxFeed{
    publicint getnum(int m,int n){
        int r=getleave(m,n);
        while(r!=0){
            int[] s=swapnum(m,n,r);
            m=s[0];
            n=s[1];
            r=getleave(m,n);
        }
        return n;
    }
    /**
     *@paramm
     *@paramn
     *@return
     */
    privateint getleave(int m,int n){
        int r=m%n;
        return r;
    }
    /**
     *<p>comments:交换
     *          </p>
     *@paramm
     *@paramn
     *@paramr
     *@return
     */
    privateint[] swapnum(int m,int n,int r){
        m=n;
        n=r;
        int[] s=newint[2];
        s[0]=m;
        s[1]=n;
        return s;
    }
    /**
     *<p>comments:测试用例
     *          </p>
     *@paramargs
     */
    publicstaticvoid main(String[] args){
        MaxFeed maxFeed=new MaxFeed();
        int r=maxFeed.getnum(96,27);
        System.out.println("***********************************\n\n\n");
        System.out.println("                 "+r);
        System.out.println("***********************************");
    }
}