Package g0301_0400.s0396_rotate_function

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    396 - Rotate Function\.

    Medium

    You are given an integer array nums of length n.

    Assume <code>arr<sub>k</sub></code> to be an array obtained by rotating nums by k positions clock-wise. We define the rotation function F on nums as follow:

    • <code>F(k) = 0 * arr<sub>k</sub>0 + 1 * arr<sub>k</sub>1 + ... + (n - 1) * arr<sub>k</sub>n - 1.</code>

    Return the maximum value of F(0), F(1), ..., F(n-1).

    The test cases are generated so that the answer fits in a 32-bit integer.

    Example 1:

    Input: nums = 4,3,2,6

    Output: 26

    Explanation:

    F(0) = (0 * 4) + (1 * 3) + (2 * 2) + (3 * 6) = 0 + 3 + 4 + 18 = 25

    F(1) = (0 * 6) + (1 * 4) + (2 * 3) + (3 * 2) = 0 + 4 + 6 + 6 = 16

    F(2) = (0 * 2) + (1 * 6) + (2 * 4) + (3 * 3) = 0 + 6 + 8 + 9 = 23

    F(3) = (0 * 3) + (1 * 2) + (2 * 6) + (3 * 4) = 0 + 2 + 12 + 12 = 26

    So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.

    Example 2:

    Input: nums = 100

    Output: 0

    Constraints:

    • n == nums.length

    • <code>1 <= n <= 10<sup>5</sup></code>

    • -100 &lt;= nums[i] &lt;= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxRotateFunction(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait