solution/0300-0399/0396.Rotate Function/Solution.ts at main

main

leetcode-beef

322 issues
2 pull requests
5,000 files
1 active branch

List view

solution\0300-0399\0396.Rotate Function\Solution.ts

4 Complexity
1.33 Complexity / M
0 Duplication
1 Churn
11 Lines
11 Lines of Code
3 Methods
3.67 LOC / Method

function maxRotateFunction(nums: number[]): number {
    const n = nums.length;
    const sum = nums.reduce((r, v) => r + v);
    let res = nums.reduce((r, v, i) => r + v * i, 0);
    let pre = res;
    for (let i = 1; i < n; i++) {
        pre = pre - (sum - nums[i - 1]) + nums[i - 1] * (n - 1);
        res = Math.max(res, pre);
    }
    return res;
}