function gongyueshu(m,n){
var u=+m,v=+n,t=v;
while(v != 0){
t = u % v;
u = v ;
v = t ;
}
return u+"<br />";
}
document.write(gongyueshu(6,8)+"<hr />");
//2
...全文
1461打赏收藏
不用辗转相除法如何求两个正整数的最大公约数?
function gongyueshu(m,n){ var u=+m,v=+n,t=v; while(v != 0){ t = u % v; u = v ; v = t ; } return u+""; } document.write(gongyueshu(6,8)+""); //2