js实现1到N(N为正整数)的最小公倍数

发布网友发布时间：2022-04-22 18:04

共2个回答

热心网友时间：2022-04-22 19:33

这个没考虑性能，简单粗暴，汗~
function minCM(list) { // N个数的最小公倍数
if(list.length === 1) {
return list[0]
}
return list.rece((a,b) => {
var total = max = Math.max(a, b);
while(!(total % a === 0 && total % b === 0)) {
total += max
}
return total
})
}
var data = Array.from({length: 3 /*N*/}).map((v,k) => k + 1) // 创建1~N的数组
console.log(minCM(data));

热心网友时间：2022-04-22 20:51

Private Sub command1_click() Dim m As Integer, n As Integer Dim a As Integer, b As Integer Dim r As Integer m = InputBox("输入m") n = InputBox("输入n") a = m b = n Do r = Abs(m - n) m = n n = r Loop While m <> n Print a; "和"; b; "最大公约数是"; r Print a; "和"; b; "最小公倍数是"; a * b / r End Sub