var num=[4,6,7,8,11];
var divisor = this.divisor_multiple(num);
// 最大公约数divisor_multiple(arr) {var onum = 0,i = 0,midNum = 0;for (; i < arr.length; i++) {onum = Math.floor(arr[i]); //去掉小数midNum = this.gcd(midNum, onum);}return midNum;},//两个数的最大公约数gcd(a, b) {var minNum = Math.min(a, b),maxNum = Math.max(a, b),i = minNum,vper = 0;if (a === 0 || b === 0) {return maxNum;}for (; i <= maxNum; i++) {vper = minNum * i;if (vper % maxNum === 0) {return vper;break;}}},