我正试图完成lulz的CodeWars挑战,但我似乎无法获得足够的性能以通过提交。该解决方案是正确的,并通过了所有测试,但它未能通过性能测试,取> 120000毫秒如何优化/调试nonperformant javascript代码
我的2个问题FOR YOU
人应该如何调试性能问题?我不知道如何开始调试性能和识别非代码代码,或者如何故意优化代码
这个特定的代码有什么问题?有没有一种模式,我正在执行不正确?是否有一些代码发生了太多次?
详细要求可以在这里找到: https://www.codewars.com/kata/integers-recreation-one ```
//generate an array of range, containing every number M to N
//map1: for each number find all divisors
//map2: for each array of divisors, format answer for tests
//filter out undefined results
let listSquared = (m, n) => range(m,n)
.map(nextNumberInRange => findDivisors(nextNumberInRange))
.map(arrayOfDivisors => formatAnswer(
arrayOfDivisors[arrayOfDivisors.length - 1],
squareAndSumAll(arrayOfDivisors)))
.filter(x => x !== undefined)
//if the square root of y (the sum of squared divisors) is WHOLE, return [x,y]
let formatAnswer = (x,y) => Math.sqrt(y) % 1 === 0 ? [x,y] : undefined
//find all divisors of any integer
let findDivisors = (x) => range(1,x).filter(y => x%y === 0 || y===x)
//generate an array containing values from start to end.
//e.g. 100-500, 351-293487 etc.
let range = (start,end) => [...Array((end-start)+1)].map((x,i)=> start+i)
let squareAndSumAll = (x) => x.map(square).reduce(add)
let add = (x,y) => x + y
let square = (x) => x * x
详细要求可以在这里找到: https://www.codewars.com/kata/integers-recreation-one
你应该能够代码掴到窗口在他们的网站上,并重新创建通过输入和失败的计时器测试。