JavaScript:实现找到具有 500 个除数的第一个三角形数算法
const getNumOfDivisors = (num) => {
// initialize numberOfDivisors
let numberOfDivisors = 0
// if one divisor less than sqrt(num) exists
// then another divisor greater than sqrt(n) ex
const getNumOfDivisors = (num) => {
// initialize numberOfDivisors
let numberOfDivisors = 0
// if one divisor less than sqrt(num) exists
// then another divisor greater than sqrt(n) ex