JavaScript Mini-Max Sum - 来自 HackerRank 网站的挑战

cla*_*opb 3 javascript algorithm

这是挑战:

https://www.hackerrank.com/challenges/mini-max-sum/problem

尽管我的答案返回与预期结果相同的数字,但我做错了什么,因为我的答案被拒绝了。我该如何解决?

这是我尝试过的解决方案:

function miniMaxSum(arr) {   

  var arrClone1 = arr.slice() 
  var arrClone2 = arr.slice() 

  var arrMinor = arrClone1.sort(function(a, b){return a - b;})
  arrMinor.pop()

  var arrMajor = arrClone2.sort(function(a, b){return b - a;})
  arrMajor.pop()

  function getSum(a, b) {
    return a + b;
  }

  var result1 = arrMinor.reduce(getSum) 
  var result2 = arrMajor.reduce(getSum)    

  console.log(`${result1} ${result2}`) // it is returning: 10 14 
Run Code Online (Sandbox Code Playgroud)

小智 5

我认为解决方案应该更容易:

function miniMaxSum(arr) {
    let sum = arr.reduce((a, b) => a + b);
    let maxVal = Math.max(...arr);
    let minVal = Math.min(...arr);
    console.log((sum - maxVal) + ' ' + (sum - minVal));
}
Run Code Online (Sandbox Code Playgroud)