![[Leetcode] 798. Smallest Rotation with Highest Score 解题报告](https://file2.kaopuke.com:8081/files_image/reation/bcimg9.png)
[Leetcode] 798. Smallest Rotation with Highest Score 解题报告
题目：Given an array A, we may rotate it by a non-negative integer K so that the array becomes A[K], A[K+1], A{K+2], ... A[A.length - 1], A[0], A[1], ..., A[K-1]. Afterward, any entries that a
