396.leetcode Rotate Function(easy)[找规律]

Given an array of integers A and let n to be its length.

Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:

F(k) = 0 * Bk[0] + 1 * Bk[1] + ... + (n-1) * Bk[n-1].

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

Note:
n is guaranteed to be less than 105.

Example:

A = [4, 3, 2, 6]

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.

解法一采用了暴力破解是O(n2)，解法二观察后一项与前一项的关系发现后一项是前一项加上数组值的和之后减去当前末尾项*n的结果。

int maxRotateFunction(vector<int>& A) {
        int n = A.size();
        if(n == 0) return 0;
        int max = -2147483648;
        for(int i=0;i<n;i++)
        {
            int tips = 0;
            int sum = 0;
            for(int j=i;;++j)
            {
                if(j<n)
            	   sum += tips*A[j];
            	else
                   sum += tips*(A[(j-n)%n]);
                //cout<<sum<<endl;
                ++tips;
                if(tips == n)
                {
                    break;
                }
            }
            if(max<sum)
              max = sum;
        }
        return max;
}

int maxRotateFunction(vector<int>& A) {
        int n = A.size();
        if(n == 0) return 0;
        int max = -2147483648;
        int sum = 0;
        int start = 0;
        for(int i=0;i<n;i++)
        {
            sum += A[i];
            start += i*A[i];
        }
        //cout<<sum<<" "<<start<<endl;
        int k = n;
        while(k--)
        {
            //cout<<start<<endl;
            if(start>max)
               max = start; 
            start = start+sum-n*A[k];
        }
        return max;
    }