leecode-396 -前缀和

暴力破解 （会超时）存在大量重复计算

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxRotateFunction = function (nums) {
  if (!nums || nums.length == 1) return 0
  let result = -Infinity
  for (let i = 0; i < nums.length; i++) {
    let sum = 0
    let n = 0
    for (let m = i; m < nums.length; m++) {
      sum += n * nums[m]
      n++
    }
    for (let k = 0; k < i; k++) {
      sum += n * nums[k]
      n++
    }
    result = Math.max(result, sum)
  }
  return result
}

提取重复计算

假设数组为[a, b, c, d, e]，长度为n，数组和为sum，可以发现旋转函数如下：

F(0) = 0 * a + 1 * b + 2 * c + 3 * d + 4 * e
F(1) = 1 * a + 2 * b + 3 * c + 4 * d + 0 * e
F(2) = 2 * a + 3 * b + 4 * c + 0 * d + 1 * e
…
F(1) - F(0) = a + b + c + d + e - 5 * e
F(2) - F(1) = a + b + c + d + e - 5 * d
…
所以 F(k) = F(k - 1) + sum + n * nums[n - k]，遍历过程每次取最大值即可。

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxRotateFunction = function (nums) {
  if (!nums || nums.length == 1) return 0
  let sumNums = nums.reduce((pre, current) => pre + current, 0)
  let fn = 0
  nums.forEach((val, index) => {
    fn += index * val
  })
  let result = fn
  let n = nums.length
  for (let i = 1; i < nums.length; i++) {
    fn = sumNums + fn - n * nums[nums.length - i]
    result = Math.max(result, fn)
  }
  return result
}