Easiest possible solution for -798. Smallest Rotation with Highest Score
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nfrom typing import List\n\nclass Solution:\n    def bestRotation(self, nums: List[int]) -> int:\n        n = len(nums)\n        change = [1] * n\n        for i in range(n):\n            change[(i - nums[i] + 1) % n] -= 1\n        max_i = 0\n        for i in range(1, n):\n            change[i] += change[i - 1]\n            if change[i] > change[max_i]:\n                max_i = i\n        return max_i\n\n```
['Python3']