classSolution{publicintmaxRotateFunction(int[] nums){int length = nums.length;int sum =0;int f =0;for(int i =0; i < length; i++){
sum += nums[i];
f += i * nums[i];}int res = f;for(int i = length -1; i >0; i--){
f = sum + f - length * nums[i];
res =Math.max(res, f);}return res;}}
题目暴力Time Out//两次遍历会Time Out public static int maxRotateFunction(int[] nums) { //模拟循环链表 int length = nums.length; int max = Integer.MIN_VALUE; for (int i = length; i > 0; i--) { int index = i;