第六天刷题

 

class solution{
public:
int best(vector<int>& nums){
int n = nums.size();
vector<int> diff(n);
for(int i=0;i<n;i++){
int low = (i+1)%n;
int hight = (i-num[i]+n+1)%n;
diffs[low]++;
diffs[high]--;
if(low>=high){
diffs[0]++;
}
}
int bestIndex = 0;
int maxScore = 0;
int score = 0;
for(int i =0;i<n;i++){
score+=diffs[i];
if(score>maxscore){
bestIndex = i;
maxscore = score;
}
}
return bestIndex;
}
}