当前位置：首页 > 求公约数最简比值javascript算法

求公约数最简比值javascript算法

发布于 2018-06-07 阅读 2119 次 Javascript 
  1. <!doctype html>
  2. <html lang="en">
  3. <head>
  4.     <meta charset="UTF-8">
  5.     <title>公约数  简比</title>
  6.     <style>
  7.         div{padding:20px;}
  8.     </style>
  9. </head>
  10. <body>
  11.     <script type="text/javascript">
  12.         //求两个数的比值
  13.         function getRatio(a, b){
  14.             var ma = 1,mb = 1,c;//倍数
  15.             a += '',b += '';
  16.             if(a.indexOf('.')>-1){
  17.                 ma = Math.pow(10,a.split('.')[1].length);
  18.             }else if(a.indexOf('/')>-1){
  19.                 ma = +a.split('/')[1]
  20.             }
  21.             if(b.indexOf('.')>-1){
  22.                 mb = Math.pow(10,b.split('.')[1].length);
  23.             }else if(b.indexOf('/')>-1){
  24.                 mb = +b.split('/')[1]
  25.             }
  26.             a = eval(a)*ma*mb;
  27.             b = eval(b)*ma*mb;
  28.             c =  getCommonDivisor(a,b);
  29.             console.log('最小整数比：'+(a/c)+':'+(b/c));
  30.         }
  32.         // 计算多个数字的最简比值
  33.         function getRatioMore(arr){
  34.             var i = 0, ln = arr.length, newArr = [], 
  35.             resArr = [],
  36.             mnum=1, multiple = 1, c;
  37.             //制作新数组
  38.             for(i=0; i<ln; i++){
  39.                 arr[i] += '';
  40.                 if(arr[i].indexOf('.')>-1){
  41.                     mnum = Math.pow(10, arr[i].split('.')[1].length);
  42.                     multiple *= mnum;
  43.                 }else if(arr[i].indexOf('/') >-1){
  44.                     mnum = +arr[i].split('/')[1];
  45.                     multiple *= mnum;
  46.                 }
  47.             }
  48.             for(var j=0; j<ln; j++){
  49.                 newArr[j] = arr[j] * multiple;
  50.             }
  51.             console.log(newArr);
  52.             c = getCommonDivisorMore(newArr);//求公约数
  53.             for(var i=0; i<ln; i++){
  54.                 resArr.push(newArr[i]/c);
  55.             }
  56.             console.log(resArr.join(':'));
  57.         }
  58.         //计算最大公约数,阿基里德算法
  59.         function getCommonDivisor(a,b){
  60.             var c;
  61.             if(a<b){
  62.                 b = [a,a=b][0];
  63.             }
  64.             while(c = a%b){
  65.                 a = b;
  66.                 b = c;
  67.             }
  68.             return b;
  69.         }
  70.         //计算多个数字的最大公约数
  71.         function getCommonDivisorMore(arr){
  72.             if(arr instanceof Array && arr.length > 1){
  73.                 var i, ln = arr.length, prevd = arr[0];
  74.                 for(i = 0; i<ln; i++){
  75.                     prevd = getCommonDivisor(prevd, arr[i]);
  76.                 }
  77.                 return prevd;
  78.             }
  79.         }
  80.         console.log(getCommonDivisorMore([205, 620, 320, 440]));
  81.         getRatioMore([20.5, 62, 32, 44])
  82.     </script>
  83. </body>
  84. </html>
相关文章
京ICP备2020048062号-1
Copyright © w2le.com, All Rights Reserved