Package g0701_0800.s0798_smallest_rotation_with_highest_score

Class Solution

java.lang.Object

g0701_0800.s0798_smallest_rotation_with_highest_score.Solution

public class Solution
extends Object

798 - Smallest Rotation with Highest Score.<p>Hard</p> <p>You are given an array <code>nums</code>. You can rotate it by a non-negative integer <code>k</code> so that the array becomes <code>[nums[k], nums[k + 1], ... nums[nums.length - 1], nums[0], nums[1], ..., nums[k-1]]</code>. Afterward, any entries that are less than or equal to their index are worth one point.</p> <ul> <li>For example, if we have <code>nums = [2,4,1,3,0]</code>, and we rotate by <code>k = 2</code>, it becomes <code>[1,3,0,2,4]</code>. This is worth <code>3</code> points because <code>1 > 0</code> [no points], <code>3 > 1</code> [no points], <code>0 <= 2</code> [one point], <code>2 <= 3</code> [one point], <code>4 <= 4</code> [one point].</li> </ul> <p>Return <em>the rotation index</em> <code>k</code> <em>that corresponds to the highest score we can achieve if we rotated</em> <code>nums</code> <em>by it</em>. If there are multiple answers, return the smallest such index <code>k</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,3,1,4,0]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong></p> <pre><code> Scores for each k are listed below: k = 0, nums = [2,3,1,4,0], score 2 k = 1, nums = [3,1,4,0,2], score 3 k = 2, nums = [1,4,0,2,3], score 3 k = 3, nums = [4,0,2,3,1], score 4 k = 4, nums = [0,2,3,1,4], score 3 So we should choose k = 3, which has the highest score. </code></pre> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,3,0,2,4]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong></p> <pre><code> nums will always have 3 points no matter how it shifts. So we will choose the smallest k, which is 0. </code></pre> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>0 <= nums[i] < nums.length</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	bestRotation(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

bestRotation

public int bestRotation(int[] nums)